Self-Avoiding Walk using backtracking recursion
Given : lattice m×n<br>
I'm require to enumerate all path that have no more than one intersection and that ends at the upper right corner using backtracking and recursion !? any suggestions .? 
<br> 
[Self-Avoiding Walk][1]


  [1]: http://mathworld.wolfram.com/Self-AvoidingWalk.html
Self-Avoiding Walk using backtracking recursion
===

Given : lattice m×n<br>
I'm require to enumerate all path that have no more than one intersection and that ends at the upper right corner using backtracking and recursion !? any suggestions .? 
<br> 
[Self-Avoiding Walk][1]


  [1]: http://mathworld.wolfram.com/Self-AvoidingWalk.html