OJ Board

http://acm.pku.edu.cn/JudgeOnline/showp ... em_id=2055

This is similar to:
http://olympiads.win.tue.nl/ioi/ioi94/c ... ution.html

Could anyone show me some ideas?

I solved Clocks (IOI 1994) and it's easily solvable with a breadth-first search (imagine every configuration is a node and every move is an edge). Otherwise, because there are only 4^9 possible configurations, do exaustive search.

Ciao
Ale

I've solved this with branch and bound, and did pretty good time