MazeMan: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

14 February 2023

  • curprev 06:4006:40, 14 February 2023 Kmk21 talk contribs 854 bytes +854 Created page with "This problem gives us and ASCII maze with a few entrances and tells us how many dots are reachable, and how many different entrances we have to use to reach these dots. In short, it's asking us how many connected components there are. This is a relatively straightforward flood-fill problem, whereby we walk around the permiter of the maze to find an un-used entrance, and flood fill. If we ecounter any dots on this fill, we increment our count by 1. We also mark any exit..."
Retrieved from "https://wiki.speedyguy17.info/index.php/MazeMan"