Re:Show HN: My weekend project - Chessboard picture recognition
by wahnfrieden on Thursday August 04, 2011 @09:26PM
(#2848582)
A knight can in fact visit every position, without even revisiting any of them. Computing this is actually a classic CS problem. Here's proof http://en.m.wikipedia.org/wiki/File:Knight%27s_tour_anim_2.g... :)
[ Parent
| on HN ]
There are no comments on this comment yet.