Talk:Knight's tour: Difference between revisions

→‎The 7x7 problem: updated results + comment on pattern of failure on 7x7
(→‎The 7x7 problem: updated results + comment on pattern of failure on 7x7)
Line 75:
:: This shows a summary of results for 5 tries at each starting position:
<pre>Results of tests for N=7 :
Starting Square | a1 a2 a3 a4 b2 b3 b4 c3 c4 d4 *All*
* TotalCount * | 66.67% 0.00%40 66.67% 0.00% 40 53.33% 0.00% 60.00%40 73.33% 0.00% 100.00%40 40 40 40 40 40 40 400
RandomTieBreaker * Total * | 80.00% 0.00% 4070.00% 0.00% 6080.00% 0.00% 4062.0050% 8092.0050% 0.00% 100.00% 48.50%
FirstTieBreakerExperimentalBreaker | 80.00% 0.00% 8070.00% 0.00% 4080.00% 0.00% 8050.00% 6090.00% 0.00% 100.00% 47.00%
RothTieBreakerFirstTieBreaker | 80.00% 0.00% 8070.00% 0.00% 6070.00% 0.00% 8070.00% 80100.00% 0.00% 100.00% 49.00%
* Count *RandomTieBreaker | 90.00% 15 15 15 15 15 15 0.00% 15 70.00% 0.00% 1580.00% 0.00% 50.00% 15 90.00% 0.00% 100.00% 15 </pre>48.00%
RothTieBreaker | 70.00% 0.00% 70.00% 0.00% 90.00% 0.00% 80.00% 90.00% 0.00% 100.00% 50.00%</pre>
 
:: The notable thing about the pattern of failure in 7x7 is that tours started every other square fail and this shifts by one every rank. The symmetries of the squares above hold for all tie breakers and the overall pattern of failure is a cross-hatching.
 
:: Looking at two cases where the start was a1 and a3, the a1 failed and a3 start did not (Random Tie Breaker). Both case went through a1 but the one starting in a3 went through a1 on move 37. Looking at the ties, there was no obvious choice that would have produced a tour. The start in a1 would have had to violate the accessibility filter to succeed. That is a1, b3, c1, a2, b4, ... fails vs. a1, b3, c1, a2, c3, ... succeeds. In the later case c3 was chosen not from the ties but from the group with the highest accessibility. I'll have to dig into this a bit more later. What I did add was a log like this showing the move, minimal accessibility, and moves in that group. This is for the failing a1:
Anonymous user