we have some n*m table(labyrinth) and two positions first is the position of the player and the second is the position of the Robot(R)↵
the player wants to reach the red doors.↵
player and monster cannot stay in the same square at the same time.↵
**both should play optimal**↵
always the player do the first move↵
We need to determine whether player can win↵
↵
<img src = "http://icecream.me/uploads/0b8a0b56a32c5d810abf7933fe6898b6.png"></img>↵
<hr>↵
Here answer is **YES**↵
↵
**This is not a standard bfs problem**↵
<br>↵
example Explanation↵
↵
the player can go up whereas the Robot doesn't know where to go (left or right)↵
if the Robot hurries to get to one end the player can easily go to the other end↵
↵
↵
I want to know if it is possible to solve this problem
the player wants to reach the red doors.↵
player and monster cannot stay in the same square at the same time.↵
**both should play optimal**↵
always the player do the first move↵
We need to determine whether player can win↵
↵
<img src = "http://icecream.me/uploads/0b8a0b56a32c5d810abf7933fe6898b6.png"></img>↵
<hr>↵
Here answer is **YES**↵
↵
**This is not a standard bfs problem**↵
<br>↵
example Explanation↵
↵
the player can go up whereas the Robot doesn't know where to go (left or right)↵
if the Robot hurries to get to one end the player can easily go to the other end↵
↵
↵
I want to know if it is possible to solve this problem
