Self avoiding paths
Public  2м:2w  7xp  Programming  73.3% 
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]
New Members
 LzyRapx 3d:1h
 doc420836131 1w
 KennTedync 1w:3d
 CharlesUNSEM 2w:4d
 famx_pencil 2w:5d
Fresh Problems

Standard Nim 3d:15h
solved by 7 
Powerful Numbers II 4d:23h
solved by 8 
Powerful Numbers I 4d:23h
solved by 8 
Ordinal Numbers II 1w:4d
solved by 7 
Ordinal numbers I 1w:4d
solved by 8