走日字棋盘 递归算法 布尔类型 怎么返回上一层

Question

#include

using namespace std;

bool can_reach(int start_c, int start_r, int finish_c, int finish_r, int num_moves) {
if (num_moves == 0) {
if ((start_c == finish_r) && (start_r == finish_r)) {
//cout << "same point" << endl;
return true;
}
//else {
// cout << "no" << endl;
// return false;
//}
}
else {
if ((start_c > 7 || start_c < 0) || (start_r > 7 || start_r < 0)) {
return false;
}

    //if (num_moves < 0) {
    //  return 0;
    //}
    switch (1) {
    case 1:return can_reach(start_c + 2, start_r + 1, finish_c, finish_r, num_moves--);
    case 2:return can_reach(start_c + 2, start_r - 1, finish_c, finish_r, num_moves--);
    case 3:return can_reach(start_c + 1, start_r + 2, finish_c, finish_r, num_moves--);
    case 4:return can_reach(start_c + 1, start_r - 2, finish_c, finish_r, num_moves--);
    case 5:return can_reach(start_c - 2, start_r + 1, finish_c, finish_r, num_moves--);
    case 6:return can_reach(start_c - 2, start_r - 1, finish_c, finish_r, num_moves--);
    case 7:return can_reach(start_c - 1, start_r + 2, finish_c, finish_r, num_moves--);
    case 8:return can_reach(start_c - 1, start_r - 2, finish_c, finish_r, num_moves--);
    }
    //if (start_c == finish_c) {
    //  if (start_r = finish_r) {
    //      cout << num_moves << endl;
    //      return true;
    //  }
    //}     else {
    //  return false;
    //}
}

}

int main() {
//int board[8][8];
int start_c, start_r, finish_c, finish_r, num_moves;
cout << "enter sc" << endl;
cin >> start_c;
if (!cin) {
cout << "error" << endl;
return 0;
}

cout << "enter sr" << endl;
cin >> start_r;
if (!cin) {
    cout << "error" << endl;
    return 0;
}

cout << "enter fc" << endl;
cin >> finish_c;
if (!cin) {
    cout << "error" << endl;
    return 0;
}

cout << "enter fr" << endl;
cin >> finish_r;
if (!cin) {
    cout << "error" << endl;
    return 0;
}

cout << "enter nm" << endl;
cin >> num_moves;
if (!cin) {
    cout << "error" << endl;
    return 0;
}
bool can_or_not = false;
can_or_not=can_reach(start_c, start_r, finish_c, finish_r, num_moves);
cout << can_or_not << endl;

}

Answer 1

https://blog.csdn.net/goustzhu/article/details/6076015