|
|
|
|
Title: 80-Square Chess
|
|
Author(s): E. Trice
|
|
Publisher: IKAT, Universiteit Maastricht, The Netherlands. International Computer Games Association Journal, June 2004. Vol. 27, No. 2, pp. 81-95.
|
|
Abstract: Chess has evolved over a span of about 2300 years. The game was not always the "packaged game" that it is today.
Its origins are traceable to Indian ashtapada boards commonly used among dice-playing games of that time. This game spread from
culture to culture via several different means, periodically undergoing revision. Most chess players are aware of the
radical reforms that shaped the game of chess during the Medieval Era, but probably only a few players are aware of
the changes proposed by former World Champion Jose Raoul Capablanca in the 1920s. This paper focuses on the 80-square
version of chess recommended by Capablanca, identifies some of the anomalies associated with Capablanca's chess, and
proposes a slightly modified version of his setup as a plausible enhancement, called Gothic chess. New values for the
pieces on the 10 x 8 board are derived. Subsequently, five Gothic-chess computer programs are introduced.
Finally conclusions and perspectives are given.
|
|
Click here to download this paper in PDF format.
|
|
Title: The 7-piece Perfect Play Lookup Database for the Game of Checkers
|
|
Author(s): E. Trice and G. Dodgen
|
|
Publisher: Kluwer Academic Publishers, Norwell, MA. Advances in Computer Games 10, pages 211-230.
|
|
Abstract: Many research teams and individuals have computed endgame databases for the game of chess which use
the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over.
This is not the case for the game of checkers. Only one programming team has generated a checkers database capable of
announcing the distance to the terminal position. This paper examines the benefits and detriments associated with computing
three different types of checkers endgames databases, demonstrates the solutions to the longest wins in the 7-piece checkers
database, presents tables of longest wins for positions including all permutations of four pieces and fewer against three pieces
and fewer, and offers major improvements to some previously published play.
|
|
Click here to download this paper in PDF format.
|
|
 |
|
|
|
|
|