# Tag Info

6

Wrap-up: The Making Of Magic Maze Puzzle This is not a solution to the puzzle, but provides notes from its poser. This type of answer has been approved by the community. Caution: This post may contain spoilers. Inspiration This puzzle originates from a competition to invent a new genre of logic puzzle which involved moving objects. I initially asked ...

3

At the risk of flogging a dead horse, I wanted to solve it using Dijkstra's algorithm, since an answer implied that it required a computer to do so. First, we change it to a minimize problem. We know that all solutions use 19 steps, so we simply change the values to $10-x$ and then minimize the result: Initialize the top left to a value of 1. Everywhere ...

6

@Mohit Jain's solution is nice and provably correct. It also shows you the best way to reach any square from the top left corner. I happened to solve the puzzle in a way that's pretty much identical, but in reverse. Both methods are equally valid, but somehow I felt that finding the optimum path from any square to the bottom right might be a more ...

17

It is a 10x10 map and you need to go east 9 times and south 9 times. There are total ${18\choose9}$ = 48620 paths which are impractical to be done with pen and paper in a reasonable amount of time. But if you observe This can be done pretty quickly with just 10x10=100 calculations. The answer is Proof of work Method

1

Local maximum solution:

Top 50 recent answers are included