Here’s something that might sound strange. Today, while playing the retro puzzle game “Mushroom Man” — a great throwback to “Chip’s Challenge” — I noticed how similar one of the levels was to solving a programming contest question. In level 113 “Don’t …
Tag Archives: Algorithms
Solving Continuity Levels with Dijkstra’s Shortest Path
Posted by zAlbee
on April 16, 2010
No comments