> Both can be technically be modeled with a lookup table, but for Othello that table would be size 3^63.
Could you just generate the subset you need denovo each time? Or the far smaller number of 1-dimensional lines?
Could you just generate the subset you need denovo each time? Or the far smaller number of 1-dimensional lines?
I would argue the optimal compression for such a table is a representation of the geometric algorithm of determining move validity that all humans use intuitively, and speculate that any other compression algorithm below size say 1MB necessarily could be reduced to the geometric one.
In other words, Othello is a stateful, complex game, so if GPT is doing validation efficiently, it necessarily encoded something that unequivocally can be described as the "geometric structure".