Javascript 骑士';s巡更算法-TypeError:无法设置未定义的属性
我试图实现N.Wirth的《算法和数据结构》一书中的Knight's Tour算法。原始版本是用Oberon编写的: 问题是我在Javascript 骑士';s巡更算法-TypeError:无法设置未定义的属性,javascript,algorithm,Javascript,Algorithm,我试图实现N.Wirth的《算法和数据结构》一书中的Knight's Tour算法。原始版本是用Oberon编写的: 问题是我在h[u][v]=I行收到一个错误“无法设置未定义的属性'-1'” 在步骤36,算法进入电路板的死端。帮个小忙 var n = 8; // size of the board var nsqr = n * n; // board matrix var h = []; for (var i = 0; i < n; i++) { h[i] = [];
h[u][v]=I行收到一个错误“无法设置未定义的属性'-1'”代码>
在步骤36,算法进入电路板的死端。帮个小忙
var n = 8; // size of the board
var nsqr = n * n;
// board matrix
var h = [];
for (var i = 0; i < n; i++) {
h[i] = [];
}
var dx = [2, 1, -1, -2, -2, -1, 1, 2]; // coordinates difference along X, possible 8 moves
var dy = [1, 2, 2, 1, -1, -2, -2, -1]; // coordinates difference along Y, possible 8 moves
// knight's tour
function knightsTour(xin, yin) {
clear();
h[xin][yin] = 1; // initial position and step number
var done = false;
tryNextMove(xin, yin, 1, done);
}
// clear
function clear() {
for (var i = 0; i < n; i++) {
for (var j = 0; j < n; j++) {
h[i][j] = 0;
}
}
}
// try next move
function tryNextMove(x, y, i, done) {
var eos; // end of steps, bool
var u, v; // new step coordinates
var k; // new step index
function next(eos) {
do {
k++;
if (k < 8) {
u = x + dx[k];
v = y + dy[k];
}
} while (k < 8 && (u < 0 || u >= n || v < 0 || v >= n || h[u][v] != 0));
eos = (k == 8);
}
function first(eos) {
eos = false;
k = -1;
next(eos);
}
if (i < nsqr) {
first(eos);
while (!eos && !canBeDone(u, v, i+1)) {
next(eos);
}
done = !eos;
} else {
done = true;
}
}
// can tour be done
function canBeDone(u, v, i) {
var done = false; // bool
h[u][v] = i; // ERROR here
tryNextMove(u, v, i, done);
if (!done) { h[u][v] = 0; }
return done;
}
knightsTour(3, 1);
console.log(h);
var n=8;//董事会的规模
var nsqr=n*n;
//板矩阵
var h=[];
对于(变量i=0;i=n | v<0 | v>=n | h[u][v]!=0));
eos=(k==8);
}
功能优先(eos){
eos=假;
k=-1;
下一步(eos);
}
如果(i
此版本适用于n=4…9:
function knightsTour(x0, y0, size = 8) {
var done = false;
var h = []; // chess board matrix
for (var i = 0; i < size; i++) {
h[i] = [];
}
var nsqr = size * size;
// initializing the board
for (var i = 0; i < size; i++) {
for (var j = 0; j < size; j++) {
h[i][j] = 0;
}
}
// coordinates difference along X and Y, possible 8 moves
var dx = [2, 1, -1, -2, -2, -1, 1, 2];
var dy = [1, 2, 2, 1, -1, -2, -2, -1];
h[x0][y0] = 1; // initial position and step number
// check if move can be done
function canBeDone(u, v, i) {
h[u][v] = i;
done = tryNextMove(u, v, i);
if (!done) {
h[u][v] = 0;
}
return done;
}
// try next move
function tryNextMove(x, y, i) {
var done;
// u, v - new step coordinates; k - new step index; eos - end of steps, bool
var env = {"done": false, "eos": false, "u": x, "v": y, "k": -1};
function next() {
x = env.u;
y = env.v;
while (env.k < 8) {
env.k += 1;
if (env.k < 8) {
env.u = x + dx[env.k];
env.v = y + dy[env.k];
}
if ((env.u >= 0 && env.u < size) && (env.v >= 0 && env.v < size) && h[env.u][env.v] == 0) {
break;
}
}
env.eos = (env.k == 8);
}
if (i < nsqr) {
next();
while (!env.eos && !canBeDone(env.u, env.v, i+1)) {
next();
}
done = !env.eos;
} else {
done = true;
}
return done;
}
tryNextMove(x0, y0, 1);
//console.log(h);
return h;
}
功能骑士(x0,y0,大小=8){
var done=false;
var h=[];//棋盘矩阵
对于(变量i=0;i=0&&env.u=0&&env.v
首先要检查的是如何界定u
和v
的范围
检查此代码
在first()
和next()
中,您将u
和v
作为参数。但这意味着该函数的u
和v
副本与您在canBeDone
中引用的副本不同
现在的问题是,当u=9
时,该算法失败。这是进一步调试的起点
var n = 8; // size of the board
var nsqr = n * n;
// board matrix
var h = [];
for (var i = 0; i < n; i++) {
h[i] = [];
}
var dx = [2, 1, -1, -2, -2, -1, 1, 2]; // coordinates difference along X, possible 8 moves
var dy = [1, 2, 2, 1, -1, -2, -2, -1]; // coordinates difference along Y, possible 8 moves
// knight's tour
function knightsTour(xin, yin) {
clear();
h[xin][yin] = 1; // initial position and step number
var done = false;
tryNextMove(xin, yin, 1, done);
}
// clear
function clear() {
for (var i = 0; i < n; i++) {
for (var j = 0; j < n; j++) {
h[i][j] = 0;
}
}
}
// try next move
function tryNextMove(x, y, i, done) {
var eos; // end of steps, bool
var u, v; // new step coordinates
var k; // new step index
function next(eos) {
do {
k++;
if (k < 8) {
uNew = x + dx[k];
vNew = y + dy[k];
}
} while (k < 8 || (u < 0 && u >= n && v < 0 && v >= n && (h[u][v] != 0)));
eos = (k == 8);
}
function first(eos) {
eos = false;
k = -1;
next(eos, u, v);
}
if (i < nsqr) {
first(eos);
while (!eos && !canBeDone(u, v, i+1)) {
next(eos);
}
done = !eos;
} else {
done = true;
}
}
// can tour be done
function canBeDone(u, v, i) {
var done = false; // bool
h[u][v] = i; // ERROR here
tryNextMove(u, v, i, done);
if (!done) { h[u][v] = 0; }
return done;
}
knightsTour(3, 1);
console.log(h);
var n=8;//董事会的规模
var nsqr=n*n;
//板矩阵
var h=[];
对于(变量i=0;i=n&&v<0&&v>=n&&h[u][v]!=0));
eos=(k==8);
}
功能优先(eos){
eos=假;
k=-1;
下一步(eos,u,v);
}
如果(i
我认为,u
,v
值在那里乱七八糟。记录u,v