I'm not sure how compact a Vec<bool> is. A specialised bit-set may produce a more compact board representation, which may result in improved performance, as larger boards could fit in faster levels of the memory hierarchy.
It would need to be tested empirically. An idea for doing so would be to brute-force a small board, like 3x3, in the corner of a larger and larger complete position, to see how the performance changes as the board gets larger (while the game tree stays a constant size).
I'm not sure how compact a
Vec<bool>is. A specialised bit-set may produce a more compact board representation, which may result in improved performance, as larger boards could fit in faster levels of the memory hierarchy.It would need to be tested empirically. An idea for doing so would be to brute-force a small board, like 3x3, in the corner of a larger and larger complete position, to see how the performance changes as the board gets larger (while the game tree stays a constant size).