acwing 181 回转游戏(IDA*)

题面

题解

代码

/*
 对#进行编号
      0     1
      2     3
4  5  6  7  8  9  10
      11    12
13 14 15 16 17 18 19
      20    21
      22    23
*/

#include<bits/stdc++.h>

using namespace std;
const int N = 24;

int q[N];
int path[100];

//八种操作方式
int op[8][7] = {
        {0,  2,  6,  11, 15, 20, 22},
        {1,  3,  8,  12, 17, 21, 23},
        {10, 9,  8,  7,  6,  5,  4},
        {19, 18, 17, 16, 15, 14, 13},
        {23, 21, 17, 12, 8,  3,  1},
        {22, 20, 15, 11, 6,  2,  0},
        {13, 14, 15, 16, 17, 18, 19},
        {4,  5,  6,  7,  8,  9,  10}
};
//中间的8个数
int center[8] = {6, 7, 8, 11, 12, 15, 16, 17};
//逆操作
int opposite[8] = {5, 4, 7, 6, 1, 0, 3, 2};

int f() {
    int sum[4] = {0};
    for (int i = 0; i < 8; i++) sum[q[center[i]]]++;
    int s = 0;
    for (int i = 1; i <= 3; i++) s = max(s, sum[i]);
    return 8 - s;
}

void operation(int x) {
    int t = q[op[x][0]];
    for (int i = 0; i < 6; i++) q[op[x][i]] = q[op[x][i + 1]];
    q[op[x][6]] = t;
}

bool dfs(int depth, int max_depth, int last) {
    if (depth + f() > max_depth) return false;
    if (!f()) return true;
    for (int i = 0; i < 8; i++) {
        //与上一步相反，剪枝
        if (opposite[i] == last) continue;
        operation(i);
        path[depth] = i;
        if (dfs(depth + 1, max_depth, i)) return true;
        operation(opposite[i]);
    }
    return false;
}

int main() {

    while (cin >> q[0], q[0]) {
        for (int i = 1; i < N; i++) cin >> q[i];
        int depth = 0;
        while (!dfs(0, depth, -1)) depth++;
        if (!depth) cout << "No moves needed";
        for (int i = 0; i < depth; i++) cout << char('A' + path[i]);
        cout << endl;
        cout << q[6] << endl;
    }
    return 0;
}