Game Theory Keeper Looser

#1

if the problem is finder winner i.e. the ne making the last move WINS
we simply take xor of all grundy numbers which are fn(n) of all n reachable from current n and check if its 0.
but what if its keeper looser i.e. the one making the last move loses?? do we simply see if the xor is 0 using the exact same method??

#2

@shameek.agarwal
Yeah exactly
So the logic still remains the same right
Check if xor is 0
If it is the opponent will lose
Else you will lose

If your doubt is resolved please close it.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.