Suppose that you want to navigate a maze like the one in Figure 1. As you navigate the maze, you will find yourself at "
Posted: Mon Jun 06, 2022 1:55 pm
Suppose that you want to navigate a maze like the one in Figure 1. As you navigate the maze, you will find yourself at "choice points" (i.e., point where you need to select a direction among a number of possible directions). But, once you take one of those directions you may reach a "dead end". Write an algorithm that solves the maze- navigation problem. Luckily, the solution is to use some basic data structure. Figure 1: A maze. G