Suppose you're playing (classical, not duplicate) Scrabble and it's your turn. My question is:
What would be a good general defintion of a best move for you?
The definition could be of a theoretical interest only, but I'd prefer a definition which could be translated (at least partially) in program code in order to generate automatically the list of your best moves.
Some constraints of objectivity
It might be argued that the concept of best move is a subjective one. In effect, when choosing your move, you might take these factors into consideration:
- Your opponent last moves, in order to evaluate the probability that he has certain letters in his current rack. Note that in general, you can't know for sure what his letters are, except if there's no letters remaining in the bag.
- Your opponent strength. Note that in general, you can't know for sure if your opponent will know particular words or if he will see particular variations.
- Your opponent style (open or close).
- Your opponent psyche. This is what you exploit when you bluff.
The three last factors apply only if you play against a human. Indeed, a program would theoretically be of the greatest strength and it would only care about playing a good objective move.
I think that it is reasonable, therefore, to distinguish between two types of best moves: subjective ones and objective ones. My question asks for a definition of the objective one, since it is the one which can be used . In other words, we must not