02-04-2023, 07:08 PM
> So when I have two different .lud encodings (with different runtime leading to different depths) of one game they should still give the same best move when I increase the time for the slower one to match the 'completed depth' of both, is this right?
Ehm, yes I think that sounds right. Can't think of any reason right now anyway that this wouldn't be the case. Except if the differences in encoding are so substantial that "depth" no longer has the same meaning across the two implementations. For example, you might have one description of Chess where a single move is a full movement of a piece from a current site to a destination (as in our in-built version of Chess), and another description of the same game where one move is first to just "select" a piece, and selecting the destination to move it towards is modelled as a separate move altogether. In the latter model of the game, you'd have to search twice as deep to get the same results as in the former model.
Ehm, yes I think that sounds right. Can't think of any reason right now anyway that this wouldn't be the case. Except if the differences in encoding are so substantial that "depth" no longer has the same meaning across the two implementations. For example, you might have one description of Chess where a single move is a full movement of a piece from a current site to a destination (as in our in-built version of Chess), and another description of the same game where one move is first to just "select" a piece, and selecting the destination to move it towards is modelled as a separate move altogether. In the latter model of the game, you'd have to search twice as deep to get the same results as in the former model.