Self avoiding paths
Public  04/13/17  7xp  Programming  75.0% 
In the equilateral triangle lattice plan, let's point O be the origin.
A self avoiding path is built as follow :
 We start from O.
 At each step we choose one of the 6 neighbour points which has not been visited yet.
We set a value on the 6 vectors starting from a given point as follow:
We can thus associate a number to each path : the concatenation of the values of the vectors in that path.
For instance, the path given in the 1st figure has the value: 2134.
How many self avoiding paths with 12 points are there?
How many of these paths correspond to a palindromic value?
Answer format: Countpaths,Countpalindromic
You are given 618,30 for 5 points
[My timing: 30 sec]
A self avoiding path is built as follow :
 We start from O.
 At each step we choose one of the 6 neighbour points which has not been visited yet.
We set a value on the 6 vectors starting from a given point as follow:
We can thus associate a number to each path : the concatenation of the values of the vectors in that path.
For instance, the path given in the 1st figure has the value: 2134.
How many self avoiding paths with 12 points are there?
How many of these paths correspond to a palindromic value?
Answer format: Countpaths,Countpalindromic
You are given 618,30 for 5 points
[My timing: 30 sec]
Fresh Problems

Polygons ratio 3d
solved by 8 
Best Matrices Multiplication 1w:2d
solved by 10 
Equations 1w:6d
solved by 10 
First semiprime 2w:3d
solved by 10 
Triangles ratio 3w:1d
solved by 12