Human vs Computer chess contest

A simple way to "handicap" the computer in a human versus computer chess match (while still maintaining the appearance of fair playing conditions) is to constrain the computer to be deterministic. That is, if in one game it calculates a certain move, then if a successive game in the match reaches the same state, it must make the same move as it did previously. In other words, the computer will never choose to deviate from a previous game. A simple way to implement this would be to add each move to the computer's opening book that it will use in successive games. The human may, and in fact ought to, deviate.

Let this be the basis of a chess contest with a prize. To enter the contest, one pays $10 to set up an account. Using that account, one plays a series of games against the computer. Whoever defeats the computer first, wins. The computer computes each response to the many simultaneous games it is playing in some fair queueing round-robin manner. Multiple computers may be used if there are lots of contestants. The computer maintains a global "opening book" for all the moves it has made across all games. If a contestant makes a move that already has a book response (possibly because some other contestant has already tried that move, or it was in the original opening book), the response is returned immediately. Otherwise the move is placed on the queue and an estimated time the computer's response will be ready is printed, based on the current length of the queue.