c40.cpp

#include <cstdio>
#include <queue>
#include <map>

enum colour
{
	N,
	Y,
	R,
	G
};

struct State
{
	bool a[3][3];
	colour pre;

	bool operator<(const State& y) const
	{
		for (int i = 0; i < 3; i++)
		{
			for (int j = 0; j < 3; j++)
			{
				if (a[i][j] < y.a[i][j]) return true;
				else if (a[i][j] > y.a[i][j]) return false;
			}
		}
		return false;
	}
};

State NewState()
{
	State s;
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			s.a[i][j] = (1 == i % 2);
		}
	}
	s.pre = N;
	return s;
}

bool GoalState(State s)
{
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			if (not s.a[i][j]) return false;
		}
	}
	return true;
}

void PrintState(State s)
{
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			printf("%c", s.a[i][j] ? '1' : '0');
		}
	}
	printf("  %c\n", s.pre < 2 ? (s.pre < 1 ? 'N' : 'Y') : (s.pre < 3 ? 'R' : 'G'));
}

//yellow
State YY(State s)
{
	for (int i = 0; i < 3; i++)
	{
		bool tmp = s.a[i][2];
		s.a[i][2] = s.a[i][1];
		s.a[i][1] = s.a[i][0];
		s.a[i][0] = tmp;
	}
	s.pre = Y;
	return s;
}

//red
State RR(State s)
{
	s.a[1][0] = not s.a[1][0];
	s.a[1][2] = not s.a[1][2];
	s.a[2][1] = not s.a[2][1];
	s.pre = R;
	return s;
}

//green
State GG(State s)
{
	for (int j = 0; j < 3; j++)
	{
		bool tmp = s.a[0][j];
		s.a[0][j] = s.a[1][j];
		s.a[1][j] = s.a[2][j];
		s.a[2][j] = tmp;
	}
	s.pre = G;
	return s;
}

int main()
{
	State (*func[3])(State) = {YY, RR, GG};

	std::map<State, State> m;
	std::queue<State> q;

	State x = NewState();

	q.push(x);
	m[x] = x;

	State tmp;

	bool keep = true;

	while (not q.empty() and keep)
	{
		State s = q.front();
		q.pop();
		for (int i = 0; i < 3; i++)
		{
			tmp = func[i](s);
			if (0 == m.count(tmp))
			{
				m[tmp] = s;
				if (GoalState(tmp))
				{
					keep = false;
					break;
				}
				else
				{
					q.push(tmp);
				}
			}
		}
	}

	while (x < tmp or tmp < x)
	{
		PrintState(tmp);
		tmp = m[tmp];
	}

	return 0;
}