Question In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once. Example: Input 3 s.. ..# .e# Output 4 These are the unique steps: *.. *.. **. *.. **. .*. **. .*. .*. **. **. **. Input 4 .s.. .#.# #e.# .... Output 2 These are the unique steps: .**. ..*. .**. .**. .**. ..*. .**. .... The problem: ➢ Input: an integer followed by the maze. ➢ Output: total number of unique steps. (no need to print the unique steps) ➢ Task: Design an algorithm in both (pseudocode and code) to print the total number of unique steps using a backtracking algorithm.
Question
In a square maze, we can have multiple steps from ‘s’ to reach ‘e’ with one place that can only be visited once.
Example:
Input
3
s..
..#
.e#
Output
4
These are the unique steps:
*..
*..
**.
*..
**.
.*.
**.
.*.
.*.
**.
**.
**.
Input
4
.s..
.#.#
#e.#
....
Output
2
These are the unique steps:
.**.
..*.
.**.
.**.
.**.
..*.
.**.
....
The problem:
➢ Input: an integer followed by the maze.
➢ Output: total number of unique steps. (no need to print the unique steps)
➢ Task: Design an
a backtracking algorithm.
Required:
code to print the total number of unique steps using a backtracking algorithm.
All code and screenshots are given in the next step.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
