Question: problem 4 for any pair m n of positive integers...
Problem 4. For any pair m; n of positive integers, dene m;n to be the L" shaped position
in Chomp consisting of a column of m squares with the poison square at the bottom and a row
of n squares with the poison square on the left (eg. 3;6 is ). For all possible values
of m and n nd a winning strategy for either the rst or second player. Hint: symmetry
PLZ show all the steps!!! Thanks!!!