Courses/CS 460/Fall 2006/Martin, Steven

From CSWiki

[edit] Taxman Game

The goal is to find an optimal solution for Taxman for a given number N. If this is not possible, to examine different strategies and study their accuracy and runtime.

Link for the game at Lulu's site

Here is a summary of the rules, as well as some AI techniques used for optimization

Note: the above link assumes a two player game (where you pick a number, followed by the computer. The link at Lulu's site assumes a one player game (you choose all the numbers, the taxman gets what's left).

Here's an analysis of the taxman game and some possible strategies used:

Taxman Revisited: By John Trono

Rick strom has some code. There is some more code here. (I see you already link to that site.)

See further comment on course discussion page.