2 ms·
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.wikipe
by wahnfrieden 15y ago
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.gif http://en.m.wikipedia.org/wiki/File:Knight%27s_tour_anim_2.g... :)