使用递归的骑士之旅
Knight's tour using recursion
现在我正处于骑士之旅的阶段，我只希望骑士能够移动，直到他不能再移动，然后停下来。代码在大多数情况下工作正常，但偶尔代码会打印出两个相同的数字。
我的移动函数中的代码：
board[0][0] = 1;
if (row + 1 > -1 && row + 1 < 5 && col + 2 > -1 && col + 2 < 5 && board[row + 1][col + 2] == 0) {
move++;
row += 1;
col += 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 1 > -1 && row + 1 < 5 && col - 2 > -1 && col - 2 < 5 && board[row + 1][col - 2] == 0) {
move++;
row += 1;
col -= 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 1 > -1 && row - 1 < 5 && col + 2 > -1 && col + 2 < 5 && board[row - 1][col + 2] == 0) {
move++;
row -= 1;
col += 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 1 > -1 && row - 1 < 5 && col - 2 > -1 && col - 2 < 5 && board[row - 1][col - 2] == 0) {
move++;
row -= 1;
col -= 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 2 > -1 && row - 2 < 5 && col + 1 > -1 && col + 1 < 5 && board[row - 2][col + 1] == 0) {
move++;
row -= 2;
col += 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 2 > -1 && row - 2 < 5 && col - 1 > -1 && col - 1 < 5 && board[row - 2][col - 1] == 0) {
move++;
row -= 2;
col -= 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 2 > -1 && row + 2 < 5 && col + 1 > -1 && col + 1 < 5 && board[row + 2][col + 1] == 0) {
move++;
row += 2;
col += 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 2 > -1 && row + 2 < 5 && col - 1 > -1 && col - 1 < 5 && board[row + 2][col - 1] == 0) {
move++;
row += 2;
col -= 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
}
输出：
1 0 0 0 0
0 0 2 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 0 3
3 0 0 0 0
0 0 0 0 0
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 0 3
3 0 4 0 0
0 0 0 0 0
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 0 3
3 0 4 0 0
0 0 0 0 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 6 3
3 0 4 0 0
0 0 0 0 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 6 3
3 7 4 0 0
0 0 0 0 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 0 6 3
3 7 4 0 0
0 0 0 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 9 6 3
3 7 4 0 0
0 0 0 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 9 6 3
3 7 4 0 10
10 0 0 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 0 9 6 3
3 7 4 0 10
10 0 11 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 12 9 6 3
3 7 4 0 10
10 0 11 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 12 9 6 3
3 7 4 13 10
10 0 11 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 0
0 12 9 6 3
3 7 4 13 10
10 14 11 8 5
Press any key to continue . . .
1 0 0 0 0
0 0 2 0 15
15 12 9 6 3
3 7 4 13 10
10 14 11 8 5
Press any key to continue . . .
1 16 0 0 0
0 0 2 0 15
15 12 9 6 3
3 7 4 13 10
10 14 11 8 5
Press any key to continue . . .
1 16 0 0 0
0 0 2 17 15
15 12 9 6 3
3 7 4 13 10
10 14 11 8 5
Press any key to continue . . .
印板功能：
void printBoard() {
cout << endl;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
cout << setw(3) << board[i][j];
}
cout << endl;
}
}
整个程序：
// ConsoleApplication15.cpp : Defines the entry point for the console application.
#include "stdafx.h"
#include <iostream>
#include <iomanip>
using namespace std;
void makeBoard();
void moveKnight(int row, int col, int move);
void printBoard();
int board[4][4];
int main()
{
int row = 0;
int col = 0;
int move = 1;
makeBoard();
moveKnight(0, 0, 1);
printBoard();
system("pause");
return 0;
}
void makeBoard() {
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
board[i][j] = 0;
}
}
}
void printBoard() {
cout << endl;
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
cout << setw(3) << board[i][j];
}
cout << endl;
}
}
void moveKnight(int row, int col, int move) {
board[0][0] = 1;
if (row + 1 > -1 && row + 1 < 5 && col + 2 > -1 && col + 2 < 5 && board[row + 1][col + 2] == 0) {
move++;
row += 1;
col += 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 1 > -1 && row + 1 < 5 && col - 2 > -1 && col - 2 < 5 && board[row + 1][col - 2] == 0) {
move++;
row += 1;
col -= 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 1 > -1 && row - 1 < 5 && col + 2 > -1 && col + 2 < 5 && board[row - 1][col + 2] == 0) {
move++;
row -= 1;
col += 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 1 > -1 && row - 1 < 5 && col - 2 > -1 && col - 2 < 5 && board[row - 1][col - 2] == 0) {
move++;
row -= 1;
col -= 2;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 2 > -1 && row - 2 < 5 && col + 1 > -1 && col + 1 < 5 && board[row - 2][col + 1] == 0) {
move++;
row -= 2;
col += 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row - 2 > -1 && row - 2 < 5 && col - 1 > -1 && col - 1 < 5 && board[row - 2][col - 1] == 0) {
move++;
row -= 2;
col -= 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 2 > -1 && row + 2 < 5 && col + 1 > -1 && col + 1 < 5 && board[row + 2][col + 1] == 0) {
move++;
row += 2;
col += 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
else if (row + 2 > -1 && row + 2 < 5 && col - 1 > -1 && col - 1 < 5 && board[row + 2][col - 1] == 0) {
move++;
row += 2;
col -= 1;
board[row][col] = move;
printBoard();
system("pause");
moveKnight(row, col, move);
}
}
尝试将int board[4][4];替换为int board[5][5]; ：-）
相关文章：
- 将依赖名称显式标记为类型名和模板的奇怪之处
- 循环无限运行C++解决骑士之旅问题
- 为什么堆栈和堆在内存中分离得如此之多?
- 代码厨师问题伊什瓦拉(应许之地）
- 关于int :0有什么特别之处在C++
- C++ 分而治之的算法问题
- 为什么 Lisp 中 1000 阶乘的计算如此之快(并显示正确的结果）?
- 以下示例中给出的构造有什么不幸之处?
- 在国际象棋骑士巡回赛中遇到困难
- 国际象棋骑士巡回赛使用递归回溯
- 使用分而治之的最大总和子数组，为什么要以不同的方式使用 for 循环，答案是错误的？
- C++用死亡之钻印刷
- 使用堆栈的骑士之旅C++
- 骑士之旅暴力递归
- 骑士之旅 c++ 递归
- 使用递归的骑士之旅
- 使用递归的 C++ 中的骑士之旅
- 骑士之旅异常行为
- 用 c++ 解决骑士之旅
- 使用回溯的代码骑士之旅未显示任何输出
