Anonymous user
Talk:Knight's tour: Difference between revisions
→The 7x7 problem: changed indent
(→= The 7x7 problem: fixed hdr) |
(→The 7x7 problem: changed indent) |
||
Line 64:
:::: The probability of failure depends on the board size and the tiebreak rule (move consideration order, for a first- or last-wins algorithm); for random move selection, it's about 25% on a 7x7 board. The order that I picked happens to work 100% of the time for an 8x8 board, but a general solution requires a more complex algorithm. The Ganzfried paper cited above includes one such, Squirrel's algorithm, which adjusts the ordering of the moves after certain landmarks in the progress of the tour. --[[User:Markjreed|Markjreed]] 02:29, 1 June 2011 (UTC)
::
<pre>Debug log : move#, move : (accessibility) choices
1. a1 : (5) b3 c2
|