A few additional calculations...

In[]:=
TreeQ
[◼]
TTTData
["GameGraph"]
Out[]=
False
TimeConstrained​​gameTree=
[◼]
MultiwayDeletionsGraph

[◼]
TTTData
["GameGraph"],​​60
Out[]=
$Aborted
In[]:=
PathCountTTT=Association​​ResourceFunction["DirectedAcyclicEvaluate"]​​
[◼]
TTTData
["GameGraph"],{_List:>1}​​["VertexWeights"];
TotalPathCountTTT[#]&/@Join​​FlattenValues
[◼]
TTTData
["FirstWinStates"],1,​​
[◼]
TTTData
["DrawStates"][9]
In[]:=
Total[Values[PathCountTTT]]
Out[]=
549946
In[]:=
gtt1=Graph[ResourceFunction["ToDirectedAcyclicGraph"][​​NearestNeighborGraph[Select[​​Tuples[{-1,0,1},4],0<=Total[#]<2&]​​],{0,0,0,0}],​​VertexCoordinatesAutomatic,​​GraphLayout"LayeredDigraphEmbedding"]
Set
:Tag Inherited in Inherited[State] is Protected.
In[]:=
gtt2=Graph
[◼]
MultiwayDeletionsGraph
[gtt1,​​{{0,0,0,0}}],​​GraphLayout"LayeredDigraphEmbedding",​​AspectRatio12
Out[]=
Set
:Tag Inherited in Inherited[State] is Protected.
In[]:=
PathCountTT=Association[​​ResourceFunction["DirectedAcyclicEvaluate"][​​gtt1,{_List:>1}​​]["VertexWeights"]];
In[]:=
Total[PathCountTT[#]&/@Select[Keys[PathCountTT],Count[#,0]==0&]]​​CountsBy[VertexList[gtt2],VertexOutDegree[gtt2,#]&][0]​​SameQ[%,%%]
Out[]=
24
Out[]=
24
Out[]=
True
​
Out[]=
24