Reseni n dam pro n = 5:
1 0 0 0 0 
0 0 0 1 0 
0 1 0 0 0 
0 0 0 0 1 
0 0 1 0 0 

1 0 0 0 0 
0 0 1 0 0 
0 0 0 0 1 
0 1 0 0 0 
0 0 0 1 0 

0 0 1 0 0 
1 0 0 0 0 
0 0 0 1 0 
0 1 0 0 0 
0 0 0 0 1 

0 0 0 1 0 
1 0 0 0 0 
0 0 1 0 0 
0 0 0 0 1 
0 1 0 0 0 

0 1 0 0 0 
0 0 0 1 0 
1 0 0 0 0 
0 0 1 0 0 
0 0 0 0 1 

0 0 0 0 1 
0 0 1 0 0 
1 0 0 0 0 
0 0 0 1 0 
0 1 0 0 0 

0 1 0 0 0 
0 0 0 0 1 
0 0 1 0 0 
1 0 0 0 0 
0 0 0 1 0 

0 0 0 0 1 
0 1 0 0 0 
0 0 0 1 0 
1 0 0 0 0 
0 0 1 0 0 

0 0 0 1 0 
0 1 0 0 0 
0 0 0 0 1 
0 0 1 0 0 
1 0 0 0 0 

0 0 1 0 0 
0 0 0 0 1 
0 1 0 0 0 
0 0 0 1 0 
1 0 0 0 0 

Dalsi reseni neexistuje.

Reseni n dam pro n = 3:
Dalsi reseni neexistuje.

Reseni ulohy kone pro n = 8 a startovni souradnici [0,0]:
0 3 2 3 2 3 4 5 
3 4 1 2 3 4 3 4 
2 1 4 3 2 3 4 5 
3 2 3 2 3 4 3 4 
2 3 2 3 4 3 4 5 
3 4 3 4 3 4 5 4 
4 3 4 3 4 5 4 5 
5 4 5 4 5 4 5 6 

[-1 -1] [2 0] [2 1] [2 4] [1 2] [2 4] [2 5] [1 5] 
[3 1] [3 2] [0 0] [2 1] [3 3] [3 6] [2 4] [3 6] 
[1 2] [0 0] [4 3] [0 4] [1 2] [0 4] [4 5] [1 5] 
[4 2] [1 2] [2 4] [1 2] [1 3] [1 6] [2 4] [1 6] 
[2 1] [2 0] [2 1] [2 4] [3 6] [2 4] [2 5] [5 5] 
[3 1] [3 2] [3 3] [3 2] [3 3] [3 6] [4 4] [3 6] 
[4 1] [4 2] [4 3] [4 2] [4 5] [4 4] [4 5] [5 5] 
[5 1] [5 2] [5 3] [5 4] [5 5] [5 4] [5 7] [5 6] 


Cesta z [0,0] do [7,7] ma delku 6 a vede pres souradnice:
[7,7], [5,6], [4,4], [3,6], [2,4], [1,2], [0,0]

Reseni ulohy kone pro n = 8 a startovni souradnici [3,4]:
3 2 3 2 3 2 3 2 
2 3 4 1 2 1 4 3 
3 2 1 2 3 2 1 2 
2 3 2 3 0 3 2 3 
3 2 1 2 3 2 1 2 
2 3 4 1 2 1 4 3 
3 2 3 2 3 2 3 2 
4 3 2 3 2 3 2 3 

[2 1] [2 2] [1 4] [2 2] [2 5] [2 6] [2 7] [2 6] 
[2 2] [3 0] [3 3] [3 4] [2 6] [3 4] [3 5] [2 5] 
[4 1] [4 2] [3 4] [4 2] [4 5] [4 6] [3 4] [4 6] 
[4 2] [5 0] [5 3] [5 4] [-1 -1] [5 4] [5 5] [2 5] 
[6 1] [2 2] [3 4] [2 2] [6 5] [2 6] [3 4] [2 6] 
[4 2] [3 0] [7 3] [3 4] [4 6] [3 4] [7 5] [6 5] 
[4 1] [4 2] [5 4] [4 2] [4 5] [4 6] [5 4] [4 6] 
[6 2] [5 0] [5 3] [5 4] [5 5] [5 4] [5 5] [6 5] 

Cesta z [3,4] do [7,7] ma delku 3 a vede pres souradnice:
[7,7], [6,5], [4,6], [3,4]

Reseni ulohy kone pro n = 3 a startovni souradnici [0,0]:
0 3 2 
3 -1 1 
2 1 4 

[-1 -1] [2 0] [2 1] 
[0 2] [-1 -1] [0 0] 
[1 2] [0 0] [0 1] 

Cesta z [0,0] do [2,2] ma delku 4 a jde pres souradnice:
[2,2], [0,1], [2,0], [1,2], [0,0]

Na souradnici  [1,1] se nelze dostat.