Year: 2025
Type: preprint
Abstract: It is well known that in games with imperfect information, such as poker, bluffing with some probability can be a component of the optimal strategy. However, as far as we know, nobody has ever exhibited a Scrabble position in which the optimal strategy involves bluffing, or even a Scrabble position in which the optimal strategy is a mixed (i.e., randomized) strategy. We present a carefully constructed Scrabble position, that could actually arise in a tournament game with no invalid words played, in which the optimal strategy (assuming that a tied score leads to the point being split equally, with no recourse to so-called "spread points" as a tie-breaking mechanism) is to make Move A with probability 1/3 and to make Move B with probability 2/3. Move B can reasonably be called a bluff, in the sense that it sets up a threat which the player cannot in fact execute, but which the opponent may not be able to rule out.
Source: arXiv (Cornell University)
Authors: Ballard, Nick, Chow, Timothy Y.
Language: English
Topic: Game Theory and Applications
Field: Decision Sciences
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W4415090286
Cites:
Cited by:
Related to: