|
|
|
|
|
|
by AnotherGoodName
116 days ago
|
|
|
Note that we search graphs that don’t fit in memory all the time. Eg. Looking ahead at chess moves. We just calculate the graph on the fly. It’s really not that out of line to search down 1000 branching binary decisions (in chess this is only a few moves ahead). |
|
|