Inicializacia
| > | 
|
| > | ![knightJumps := [[2, -1], [1, -2], [-1, -2], [-2, -1], [-2, 1], [-1, 2], [1, 2], [2, 1]]](images/jazdec22.gif){kind=small}
|
A Knight Tour Problem
Inicializacia
| > |
|
| > |
|
succesors
Popis
s, n, position -> zoznam vsetkych moznych nasledovnikov z pozicie 'position' na sachovnici 's' velkosti 'n' x 'n'
Implementacia
| > | ![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec23.gif){kind=small}
![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec24.gif){kind=small}
![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec25.gif){kind=small}
![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec26.gif){kind=small}
![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec27.gif){kind=small}
![successors := proc (s, n, position) local moves, onBoard; moves := map(proc (x) position+x end proc,knightJumps); onBoard := select(proc (x) 0 < x[1] and 0 < x[2] and x[1] <= n and x[2] <= n end proc,m...](images/jazdec28.gif){kind=small}
|
numberOfSuccessors
Popis
s, n, position -> pocet vsetkych moznych nasledovnikov z pozicie 'position' na sachovnici 's' velkosti 'n' x 'n'
Implementacia
| > | 
|
mina
Popis
s, n, position -> tah(y) s najmensim poctom nasledovnikov
Implementacia
| > | 
|
mabst
Popis
destination, successorlist -> najvzdialenejsi nasledovnici
Implemenatacia
| > |  end proc,vect...](images/jazdec218.gif){kind=small}
 end proc,vect...](images/jazdec219.gif){kind=small}
 end proc,vect...](images/jazdec220.gif){kind=small}
 end proc,vect...](images/jazdec221.gif){kind=small}
 end proc,vect...](images/jazdec222.gif){kind=small}
 end proc,vect...](images/jazdec223.gif){kind=small}
 end proc,vect...](images/jazdec224.gif){kind=small}
|
improvedWarnsdorff
Popis
n -> riesenie 'A knight tour problem'
Implementacia
| > | ![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec225.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec226.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec227.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec228.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec229.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec230.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec231.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec232.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec233.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec234.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec235.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec236.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec237.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec238.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec239.gif){kind=small}
![improvedWarnsdorff := proc (n) local s, destination, position, localMina, stepNumber; s := Matrix(n,n); destination := [round(n/2)-1/2, round(n/2)-1/2]; position := [1, 1]; s[1,1] := 1; for stepNumber ...](images/jazdec240.gif){kind=small}
|
Priklady
Priklad 1
| > | M1 := improvedWarnsdorff(9); |
Priklad 2
| > | M2 := convert(improvedWarnsdorff(50), array): |
| > | plot3d(M2[x, y], x=1..50, y=1..50); |
![[Maple Plot]](images/jazdec242.gif)
| > | densityplot(M2[x, y], x=1..50, y=1..50, grid=[50, 50]); |
![[Maple Plot]](images/jazdec243.gif)