Chess in CAL

This is a little game that demonstrates how a stateful graphical application can be written in CAL.

History

This chess game was originally written in Haskell by Steffen Mazanek. His program can be found here. The CAL version was mainly written as an exercise to learn the language. It is a simple program that uses a minimax algorithm over a game tree of four levels. The en passant and castling moves are not allowed. Unlike my asteroids game, this does not use an IO monad, but it does use the same SOEGraphics library written by Tom Davis.

Downloading Chess

The source is here.

Running Chess

Chess can be run:

  1. From ICE
  2. Standalone
  3. As an Applet.
It should look something like this:

Contact

Nik Shaylor