Computer Science/61b/Homework/hw9/GRADER - Revision history

Lensovet: Lensovet moved page CS/61b/Homework/hw9/GRADER to Computer Science/61b/Homework/hw9/GRADER

2023-02-20T03:51:36Z

Lensovet moved page CS/61b/Homework/hw9/GRADER to Computer Science/61b/Homework/hw9/GRADER

Lensovet: moved CS 61b/Homework/hw9/GRADER to CS/61b/Homework/hw9/GRADER: fix cs 61b hierarchy

2010-11-14T06:00:20Z

moved CS 61b/Homework/hw9/GRADER to CS/61b/Homework/hw9/GRADER: fix cs 61b hierarchy

Lensovet at 06:42, 22 September 2007

2007-09-22T06:42:05Z

New page

To generate a random maze, modify the depthFirstSearch() method so that the order in which you check each direction (such as <tt>if ((fromWhere != FROMRIGHT) && !verticalWall(x, y))</tt>) is randomized. Then, each time the method checks for a cycle, if it doesn't find one, it can eliminate the wall before recursively checking the other cells.

# Since the basic checking algorithm remains unchanged, it will still do the same things the current algorithm is doing - check every cell, but only once, for a cycle
# There are 4 potential directions to be checked - top, right, bottom, and left. Create an array of length 4 with the digits 1-4. Randomize the digits in the same way we randomized the walls in the original homework. Then have a switch statement, with each case containing the cell check (i.e. <tt>if ((fromWhere != FROMRIGHT) && !verticalWall(x, y))</tt>), and run a for loop iterating through the array and executing each case. This way we make sure that each case is direction is actually checked.

← Older revision	Revision as of 03:51, 20 February 2023
(No difference)

← Older revision	Revision as of 06:00, 14 November 2010
(No difference)