From bfc7065724ca03b3382f8b0f2126eab8a4f481e4 Mon Sep 17 00:00:00 2001
From: Adam Djellouli <37275728+djeada@users.noreply.github.com>
Date: Thu, 5 Dec 2024 12:28:29 +0100
Subject: [PATCH] Update backtracking.md

---
 notes/backtracking.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/notes/backtracking.md b/notes/backtracking.md
index 82cc7c1..b50d1f9 100644
--- a/notes/backtracking.md
+++ b/notes/backtracking.md
@@ -1,6 +1,6 @@
 ## Backtracking
 
-Backtracking is a systematic method for solving problems that incrementally build candidates to the solutions and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution. This approach is often used for constraint satisfaction problems, combinatorial optimization, and puzzles like the N-Queens problem or Sudoku.
+Backtracking is a method used to solve problems by building potential solutions step by step. If it becomes clear that a partial solution cannot lead to a valid final solution, the process "backtracks" by undoing the last step and trying a different path. This approach is commonly applied to **constraint satisfaction problems**, **combinatorial optimization**, and puzzles like **N-Queens** or **Sudoku**, where all possibilities need to be explored systematically while avoiding unnecessary computations.
 
 ### Recursive Functions