Question: A W-L game is a combinatorial game where each terminal node is either +- or -+ . Mimicking the proof of Zermelo's theorem, prove that

A W-L game is a combinatorial game where each terminal node is either +- or -+ . Mimicking the proof of Zermelo's theorem, prove that for every W-L game, either Louise has a winning strategy or Richard has a winning strategy
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
