10845 - The crusades
Posted: Fri May 20, 2005 8:22 am
Can somebody help to solve this problem? I don't know algorithm faster than O(2^30)...
The Online Judge board
But isn't it O(2^30) ?- Do a brute force for the first king's path
I'm not at all sure if brute force will work, but clever pruning might do the trick. I have used backtracking+pruning on some other hard graph problems with success earlier. I doubt my proposed solution is the good way to solve this problem, though.Pupirev Sergei wrote:But isn't it O(2^30) ?- Do a brute force for the first king's path