Timeline for PathFinding.java: Drawing a random perfect maze via randomized DFS
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 16 at 1:54 | comment | added | Nick is tired | Not a review, but the maze demonstrated in the screenshot is not a perfect maze, ~4 tiles down-left of the red tile there is a cycle of floor tiles, this allows multiple routes between pairs of tiles (it's also in a completely isolated section of maze, meaning there are several pairs of tiles with no route between them). | |
| Sep 15 at 14:09 | history | edited | coderodde | CC BY-SA 4.0 |
added 82 characters in body
|
| Sep 15 at 13:51 | comment | added | coderodde | @TorbenPutkonen Yes, Sir! | |
| Sep 15 at 11:17 | comment | added | TorbenPutkonen | You're using a two element array to represent a row-column coordinate. Don't be lazy, just create a record for that. You can reuse that in your Cell class instead of storing x and y (and there's an inconsistency, use x,y or row,col everywhere, don't mix). | |
| Sep 12 at 10:34 | history | edited | coderodde | CC BY-SA 4.0 |
added 13 characters in body
|
| Sep 12 at 10:27 | history | asked | coderodde | CC BY-SA 4.0 |