AlterWay Game Rules

Pieces of both colours are involved in the game. You play on the white side (you can have any units except King and pawns) and the computer plays on the black side (it can have any units except King). Any movements made on the board are your moves, the computer only devises puzzling positions and passively watches your actions, waiting for your error. Your task is to capture all of the other side's pieces; but each of your moves must be a capture. That is, no non-capturing moves may be played.

If you succeed in capturing all of the opposing pieces, you win. But if there arises a situation when no more immediate captures can be played and on the chessboard still remains at least one enemy piece, you lose. Besides, you also lose when you have failed to perform the task within the allotted time interval.

What can be easier than to capture all pieces, you may say. However, that "simplicity" is deceptive. Because in almost any situation you will be faced with the possibility of not one but several seemingly alternative captures. And in each of such situations you will have to make a correct choice, deciding what to capture next and what route to follow. Thus, you will not be able to complete the task successfully unless you quickly discover and execute an optimum sequence of captures. But to do that will require much intellectual effort on your part! In a lot of the tasks the goal can be achieved in several ways, though. The optimality of the route you have chosen is not evaluated by the program and does not affect the result. You can capture any one of the opponent's units by any one of your own units (provided that the capture is legal). It is not necessary to use all of the available units to eliminate the opponent's army: if you have several pieces, and are able to capture all enemy units using just one of them (e.g. a Queen), still it is a victory for you.

[Up]