The algorithm in Java please.
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
Suppose that you want to navigate a maze like the one in Figure 1. As you navigate the maze, you will find yourself at "
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Suppose that you want to navigate a maze like the one in Figure 1. As you navigate the maze, you will find yourself at "
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!