【发布时间】:2011-12-14 00:25:35
【问题描述】:
我在看到此错误时遇到问题。我正在使用 TextPad4.7.3,当我尝试制作 53x53 或更大的板时,我可以看到的错误在
else if (move[1][m] > 0 && move[1][m] < 9){
if(tour(movNum + 1, (x + movCol[move[0][m]]), (y + movRow[move[0][m]]), bSize, board)){
break;}}
由于这是一个递归程序,我怀疑这行是真正的问题。错误列表太长了,我看不到顶部会指出错误的实际位置。任何人都知道可以正确记录我的错误或查看错误的方法。或者如果有人知道为什么当我使用 53 或更大的数字时,这会给我一个巨大的错误列表而不是继续工作?这是一项任务,但在这一点上,我只是为了让自己满意而尝试解决它。任何帮助将不胜感激。
-WBM
import java.util.Scanner;
public class Tour {
// Knight moves
static int movCol[] = { 1, 2, 2, 1, -1, -2, -2, -1};
static int movRow[] = {-2, -1, 1, 2, 2, 1, -1, -2};
// Main method
static public void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.print("What are the board's Dimentions?");
int bSize = scan.nextInt();
int board[][] = new int[bSize][bSize];
System.out.print("Start on what column?");
int positionY = scan.nextInt();
System.out.print("Start on what row?");
int positionX = scan.nextInt();
System.out.println();
for (int i = 0; i < bSize; i=i+1) {
for (int j = 0; j < bSize; j=j+1) {
board[i][j] = -1;
}
}
tour(0, positionX - 1, positionY - 1, bSize, board);
}
static void printBoard(int board[][]) {
for(int i = 0; i < board.length; i=i+1){
for(int j = 0; j < board[0].length; j=j+1){
if (board.length < 11){
System.out.printf("%3d", board[i][j]);
}
else if (board.length < 32){
System.out.printf("%4d", board[i][j]);
}
else if (board.length < 101){
System.out.printf("%5d", board[i][j]);
}
else if (board.length < 317){
System.out.printf("%6d", board[i][j]);
}
else if (board.length < 1001){
System.out.printf("%7d", board[i][j]);
}
else if (board.length < 3163){
System.out.printf("%8d", board[i][j]);
}
else if (board.length < 10001){
System.out.printf("%9d", board[i][j]);
}
}
System.out.println("\n");
}
}
static boolean tour(int movNum, int x, int y, int bSize, int board[][]) {
boolean success = true;
board[x][y] = movNum;
if((movNum < ((bSize * bSize) - 1))){
int move[][] = new int[2][8];
for(int i = 0; i < 8; i=i+1){
if((x + movCol[i]) >= 0 && (x + movCol[i]) < bSize && (y + movRow[i]) >= 0 && (y + movRow[i]) < bSize){
if(board[x + movCol[i]][y + movRow[i]] < 0){
move[0][i] = i; // marks all possible moves
for(int h=0; h<8; h=h+1){
if((x + movCol[i] + movCol[h]) >= 0 && (x + movCol[i] + movCol[h]) < bSize && (y + movRow[i] + movRow[h]) >= 0 && (y + movRow[i] + movRow[h]) < bSize){
if(board[x + movCol[i] + movCol[h]][y + movRow[i] + movRow[h]] < 0){
move[1][i] = move[1][i] + 1;
}
}
}
}
else {
move[0][i] = i;
move[1][i] = 9;
}
}
else {
move[0][i] = i;
move[1][i] = 9;
}
}
for(int j = 0; j < 7; j=j+1){
for(int k = 0; k < 7; k=k+1){
if (move[1][k]> move[1][k+1]){
int lower = move[1][k+1];
int lower2 = move[0][k+1];
int upper = move[1][k];
int upper2 = move[0][k];
move[1][k] = lower;
move[0][k] = lower2;
move[1][k+1] = upper;
move[0][k+1] = upper2;
}
}
}
for(int m = 0; m < 8; m=m+1){
if (move[1][m] == 0 && movNum == ((bSize * bSize) - 2)){
if(tour(movNum + 1, (x + movCol[move[0][m]]), (y + movRow[move[0][m]]), bSize, board)){
break;
}
}
else if (move[1][m] > 0 && move[1][m] < 9){
if(tour(movNum + 1, (x + movCol[move[0][m]]), (y + movRow[move[0][m]]), bSize, board)){
break;
}
}
}
success = false;
board[x][y] = -1;
}
else{
printBoard(board);
System.out.println("\n");
System.exit(0);
}
return success;
}
}
【问题讨论】:
-
“一个错误。”有什么错误?堆栈溢出?还有什么?你想在 53x53 的棋盘上进行骑士之旅?!
-
在 Tour.tour(Tour.java:112) 这是一个庞大的列表。我看不到顶部 =(
标签: java arrays recursion runtime