๐Ÿงฉ

Maze Solver

Find a path through a grid maze using BFS, DFS and backtracking.

Project 12Advanced

๐Ÿงฉ Problem statement

Find a path through a grid maze using BFS, DFS and backtracking. Design it completely in pseudocode first: plan the data, split the work into functions, write the logic, dry-run it and test it.

๐Ÿ“‹ Requirements

  • Grid
  • BFS
  • DFS
  • Backtracking
  • Path finding

๐Ÿ“ฅ Inputs

  • The maze grid
  • Start and end

๐Ÿ“ค Outputs

  • A path, or 'no path'

๐Ÿ“ Rules

  • You can move up, down, left, right โ€” not through walls

๐Ÿšง Constraints

  • Maze up to 20 ร— 20

๐Ÿงญ Suggested approach

  • Restate the problem in your own words
  • List the data you must remember (variables, lists, maps)
  • Write one FUNCTION per feature
  • Write the main program that calls them
  • Dry-run with the Run button
  • Test normal cases and edge cases

๐Ÿง  Required concepts

  • Data structures
  • Algorithms
  • Complexity
โœ๏ธ Pseudocode editor ยท dry-run tool ยท test cases

Design your solution here. Use Run to dry-run it step by step. Hints unlock one at a time โ€” try on your own first!

๐Ÿงช Edge cases to test

  • Empty input
  • Very large values
  • Repeated or duplicate entries

๐Ÿš€ Challenge extensions

  • Add a feature of your own
  • Make it work for 10ร— more data โ€” what changes?

โ† All projects