| Author |
Message |
Jianying Ji (Jianying)
| | Posted on Wednesday, March 07, 2001 - 11:56 pm: | |
The goal of a game I am coding requires that the goal be the presense of a certain type of piece on the board, which is initially absent from the board. What is the simplest way to code such a goal? Also what is the simplest way to make the goal being one move away from the other goal? And how about the negation of the previous two questions, ie. making the two previous conditions lossing conditions instead of winning ones? |
Roger J Cooper (Rogercooper)
| | Posted on Friday, March 09, 2001 - 4:15 am: | |
Your question is hard to understand, please give the specifics of the winning conditions.
It sounds like you want to use the 'pieces-remaining' goal with a value of 1. You can't use Zillions to directly deal with things like being a move away from a goal, but usually you can redefine the win conditions to find something equivalent. |
Jianying Ji (Jianying)
| | Posted on Saturday, March 10, 2001 - 3:41 am: | |
Thanks for the reply.
More specifically, when you say (piece-remainning 1 somepiecetype) and you started with 0 of somepiecetype, does pieceremainnig return false at the beginning, since it is not 1 or true, since it is less than one? |
Roger J Cooper (Rogercooper)
| | Posted on Saturday, March 10, 2001 - 5:41 am: | |
To quote from the language reference
"The pieces-remaining goal is true when the player’s pieces on the board becomes equal to the given number" |
|