From 506684067aba853c23a70414b86423c5a6e7da24 Mon Sep 17 00:00:00 2001
From: Adam Djellouli <37275728+djeada@users.noreply.github.com>
Date: Mon, 23 Sep 2024 15:37:57 +0200
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 bdcafaf..6dd4963 100644
--- a/notes/backtracking.md
+++ b/notes/backtracking.md
@@ -438,7 +438,7 @@ The backtracking occurs when a node has no valid branches (no safe positions in
 - Using heuristics to choose the order of columns to try first.
 - Converting the recursive solution to an iterative one using explicit stacks to handle larger values of $N$ without stack overflow.
 
-### Example: Solve Maze
+### Example: Maze Solver
 
 Given a maze represented as a 2D grid, find a path from the starting point to the goal using backtracking. The maze consists of open paths and walls, and movement is allowed in four directions: up, down, left, and right (no diagonal moves). The goal is to determine a sequence of moves that leads from the start to the goal without crossing any walls.