Post a New Question
posted by John Wednesday, March 6, 2013 at 11:59pm.
Let G be a rectangular grid of unit squares with 3 rows and 8 columns. How many self-avoiding walks are there from the bottom left square of G to the top left square of G?
Brilliant qn! hint for you : use recursion
More Related Questions