Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • \$\begingroup\$ So far it is the only entry that gets the most optimal solution every time. I'd argue it is a better last-place reference solution too. In fact, I'm not convinced that there is actually a better way that guarantees to get an optimal solution in every case, and so far no-one else has proven otherwise. \$\endgroup\$ Commented Apr 25, 2014 at 15:08
  • 1
    \$\begingroup\$ Until you can actually find the exact number of steps it will take, I can't accept this solution even if it is (theoretically) the best one. \$\endgroup\$ Commented Apr 25, 2014 at 15:43
  • \$\begingroup\$ Also, the grid size is 19, not 9. \$\endgroup\$ Commented Apr 25, 2014 at 15:43
  • \$\begingroup\$ Okay, I fixed the grid size. Does anyone know how to calculate the theoretical minimum number of steps required? \$\endgroup\$ Commented Apr 26, 2014 at 8:40
  • \$\begingroup\$ Nope. You'd have to use a program to solve for it, which is what you have right now. \$\endgroup\$ Commented Apr 26, 2014 at 14:04