Does anyone happen to know which of those algorithms are equivalent, under the following definition of equivalent?
• Maze generation algorithms A and B are equivalent if for any maze that A can generate, it is possible for B to generate that maze too, and vice versa.
For those pairs of algorithms that are equivalent, what pairs are equivalent under this stronger definition?
• Maze generation algorithms A and B are equivalent if for any maze that A generates, B can generate it too, and vice versa, and the probability that A generates that maze on any given run is the same as the probability that B does so.
Think Labyrinth is an amazing resource here [1]. Specifically, look for the table in the "Perfect Maze Creation Algorithms" that breaks down a bunch of different maze generation algorithms.
• Maze generation algorithms A and B are equivalent if for any maze that A can generate, it is possible for B to generate that maze too, and vice versa.
For those pairs of algorithms that are equivalent, what pairs are equivalent under this stronger definition?
• Maze generation algorithms A and B are equivalent if for any maze that A generates, B can generate it too, and vice versa, and the probability that A generates that maze on any given run is the same as the probability that B does so.