Name
Abstract | ||
|---|---|---|
Although two-person Scrabble 3 as a whole is a game with hidden information, once the bag of tiles is emptied it resolves to a game of perfect information. This phase of the game is called the endgame. The state space of Scrabble endgames is characterized by high branching factors (average 200) and shallow depth (less than 15 plies). Expert endgame play involves move generation and tactical search. The article describes several design alternatives for searching this domain, including one based on Berliner's (1979) B* algorithm. The most advanced implementation of this algorithm (implemented in MAVEN, a state-of-the-art computer player) achieves almost perfect play. |
Year | Venue | Field |
|---|---|---|
2003 | ICGA JOURNAL | Computer science,Chess endgame,Artificial intelligence |
DocType | Volume | Issue |
Journal | 26 | 3 |
ISSN | Citations | PageRank |
1389-6911 | 0 | 0.34 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brian Sheppard | 1 | 40 | 5.55 |