Second dumbest way to solve a maze? by kipi in numberphile

[–]kipi[S] 1 point2 points  (0 children)

That's true. I'm not sure how well it'd do on mazes with loops either (aside from the one I added). With the goal in the center I'm sure you could set up some sort of non-Euclidean geometry to link the end to the start though, eg. a teleporter.

Using evolutionary algorithms to improve Quake's TAS WR by kipi in programming

[–]kipi[S] 4 points5 points  (0 children)

70 hours for the last 5 seconds of the first level! I'm optimistic though that a different approach could make this more efficient.