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?
1 answer
Brilliant qn! hint for you : use recursion
1 answer