【发布时间】:2018-07-30 17:18:37
【问题描述】:
我正在尝试解决这个问题,即在给定 N * M 棋盘的情况下,Knight's Tour 被定义为 Knight 的移动序列,使得 Knight 只访问每个方格一次。下面是我的代码,但是我让 Array 越界 = 8,我知道当 Moves 尝试在当前行中将值 2 与 6 相加时,它会出现,但是我不知道如何摆脱它。
int MaxMove = 64; // for 8*8 chess Board
private int Moves[][] = new int[][] {{2, 1}, {2, -1}, {1, 2}, {1, -2}, {-2, 1}, {-2, -1}, {-1, 2}, {-1, -2}};
void solveKnightTour(int[][] board)
{
knightsTourUtil(board, 0, 0, 1);
}
private boolean isSafeMove(int[][] board, int r, int c)
{
if(r < 0 && r > board.length-1 && c < 0 && c > board.length-1 && board[r][c] != -1)
return false;
return true;
}
private boolean knightsTourUtil(int[][] board, int presentRow, int presentCol, int KthMove)
{
if (KthMove >= MaxMove)
{
return true;
}
for (int i = 0; i < Moves.length; i++)
{
int nextRow = presentRow + Moves[i][0];
int nextCol = presentCol + Moves[i][1];
if (isSafeMove(board, nextRow, nextCol))
{
board[nextRow][nextCol] = KthMove;
if (knightsTourUtil(board, nextRow, nextCol, KthMove + 1))
return true;
else
board[nextRow][nextCol] = -1;
}
}
return false;
}
【问题讨论】:
标签: java recursion recursive-backtracking knights-tour