Anonymous user
Talk:Knight's tour: Difference between revisions
→The 7x7 problem
(→C++ formatting: C++ house style) |
|||
Line 68:
:::::: The way I read the reference documentation, the tour just had to cover every square. Ending on a square that was a nights-move away from the start point was an (interesting), extra requirement. --[[User:Paddy3118|Paddy3118]] 15:27, 2 June 2011 (UTC)
:::::: Donal, there are open and closed tours. You are referring to ''closed'' tours. There are no closed tours on boards of size 2 through 7 inclusive. --[[User:Dgamey|Dgamey]] 02:43, 3 June 2011 (UTC)
:: I started to measure success/failure on a 7x7 using different tie breakers. Starting with a triangle of squares that provide a minimum under rotation & reflection it really looks like starting position is the predominant factor. I haven't yet tried all cases just in case rotation/reflection does affect the results.
| |||