UVA 1343 The Rotation Game 【IDA*】

The Rotation Game

  UVA - 1343 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define ms(a,b)  memset(a,b,sizeof(a))
const int M=1e5+10;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
int i,j,k,n,m;
int a[30],maxd,path[100000];
int roller[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}};
int goalpos[8] = {6,7,8,11,12,15,16,17};
int bac[8] = {5, 4, 7, 6, 1, 0, 3, 2};
void rot(int *aa,int dir) {
    for(int i=1;i<7;i++) {
        int t = aa[roller[dir][i]];
        aa[roller[dir][i]] = aa[roller[dir][i-1]];
        aa[roller[dir][i-1]] = t;
    }
}
bool dfs(int d) {
    if(d == maxd) {
        for(int i=1;i<8;i++) {
            if(a[goalpos[i]] != a[goalpos[i-1]])  return false;
        }
        if(!d) { printf("No moves needed\n%d\n",a[6]); return true; }
        for(int i=0;i<d;i++) printf("%c",path[i]+'A');
        printf("\n%d\n",a[6]);
        return true;
    }
    else {
        int res = 0;
        int a1 = 0 , b = 0 , c = 0 ;
        for(int i=0;i<8;i++) {
            if(a[goalpos[i]] == 1) ++a1;
            else if(a[goalpos[i]] == 2) ++b;
            else if(a[goalpos[i]] == 3) ++c;
        }
        res = 8 - max(a1,max(b,c));
        if(d + res > maxd) return false;
        for(int i=0;i<8;i++) {
            path[d] = i;
            rot(a,i);
            if(dfs(d+1)) return true;
            rot(a,bac[i]);
        }
    }
    return false;
}
int main() {
    while(~scanf("%d",&a[0])&&a[0]) {
        for(int i=1;i<24;i++) scanf("%d",&a[i]);
        for(maxd = 0; ; ++maxd) {
            if(dfs(0)) break;
        }
    }
    return 0;
}