OJ Board

I don't know how you process with only the information of stumps. But try the above case.

try to change your PI to a more precise one:

I use BFS. Considering the available slots where the log can be picked up or put down, the state space is not that big. Because there are at most 15 stumps with limited row and column size(<= 15) and logs only exist between stumps, the following case is the one that comes with the greatest number of ...

Got AC. Actually we don't need to consider the above case. My ac code assumes all logs are connected by two stumps.

A clarification question -- Can we pick up the log (length == 1) in the figure below? (suppose we stand on 'B') If yes, we have a path to traverse from B to E, otherwise not. thanks.