UVA 810-a Dicey Problem

This problem test instructions understand very difficult .... So I don't want to do

Copy Test instructions:!

Place the sieve somewhere in an initial position, knowing his initial state (determined by the top point and the front point)

Flips in four directions. Conditions that can be flipped: when and only if the number of points at the top of the current is the same as the number of points in the next position.

If you can flip it back. The output path.

The difficulty is how to know the just rely on the front and top side>

Can play a big ~ ~ ~ ~ Table ... Actually do not have to play all the table ~ because the dice relative to the two sides and = 7;

Then is the path output, which is why in the BFS, without the queue and use the handwriting queue reason-can be the parent node (so called//) to save, for the final output ~

Code:

No code .... http://blog.csdn.net/accelerator_/article/details/39966329

UVA 810-a Dicey Problem