Vote count:
0
I want to implement tremaux algorithm for solving a 2d maze. I know that Tremaux algorithm requires the steps to be stored in some way. I know it is different than DFS since DFS has natural ordering whereas Tremaux is random. There are however several points I do not understand quite well. For instance, how does Tremaux rely on knowing the height and width of the maze? Also, what is the best way to store the positions you've been to? In a hashtable or a stack?
I tried finding pseudocode online but can't find any.
asked 1 min ago
Confusion regarding Tremaux Algorithm
Aucun commentaire:
Enregistrer un commentaire