For every positive integer n let alpha_n be the two-row Chomp position where the top row has a single square and the bottom row has n squares (e.g. alpha_5 is). Let beta_n be the position in Chop given by a 2 times n array (e.g. beta_5 is). Prove that the game trees for the positions alpha_n and beta_n have the same number of nodes for every n greaterthanorequalto 1