Geometry
posted by John on .
Let G be a rectangular grid of unit squares with 3 rows and 8 columns. How many selfavoiding walks are there from the bottom left square of G to the top left square of G?

Brilliant qn! hint for you : use recursion