can anyone explain me output of this test case :-
1
11
1 0 0 0 0 0 1 0 0 0 1
correct O/P- “No”
Nayeon’s optimal move is to move to cell 4, but even then he will run out of moves if Tzuyu moves to cell 8 or 10.
1 Like
1 0 0 N 0 0 1 0 0 0 1
1 0 0 N 0 0 1 T 0 0 1
1 0 N N 0 0 1 T 0 0 1
1 0 N N 0 0 1 T T 0 1
1 N N N 0 0 1 T T 0 1
1 N N N 0 0 1 T T T 1
now, N dont have a move
1 Like
first player choose the 5 zero sequence and he will think if second player comes to block him in this sequen. so he will choose such that he won the game that is from middle . but now second player will check the another seque. of zeros >= 5/2 +5%2 seq. if he found it then he will not block the first player sequn. and won the game
1 Like
What if I do this.
1 N 0 0 0 T 1 0 0 0 1
Suppose N moves forward and T moves backward. Then N wins.
Another suppose, 1 N 0 0 0 0 1 T 0 0 1, here also N wins. So isnt this the optimal to win
1 Like
got it ,thanks a lot bro . I was thinking that both of them will move to highest zero sequence and if the length of sequence is odd then Nayeon’s win else loose.
thanks a lot buddy I realised my mistake.
buddy that same mistake I was doing they have to play game optimally if he moves N at 1 position T will move to 2nd position and hence N will loose.
1 Like
Oh man🤦♂️. Got it now. Thanks
1 Like