rhinobones
Posts: 1540
Joined: 2/17/2002 Status: offline
|
I made a scenario named “Tulane” that you might find interesting. Tulane is designed to be played against either AI and PBM opponents. It’s a bit different from the standard scenarios in that there are no fixed victory point objectives and no associated victory points. Rather, there is a random selection of a primary and secondary objectives by the computer that are assigned by chance. You, the aggressive force (Tulane), are offered a choice of formations which can be deployed at a cost measured in supply points. The defensive AI player (or, Cheyenne as the Boise State PBM player) responds by protecting the entire battle field and trying to determine/defend the objective(s) of Tulane. The end result is that you will never (the actual words should be “extremely small probability”) play the same game twice as opposed to the standard scenarios which feature static starting positions, set objectives and predictable event schedules. Tulane is based on the premise that offensive and defensive forces should be randomized for starting positions. All enemy objective tracts (1, 2 and 3) are employed, as are the response to movements of the Tulane force. Most importantly, each new boot of the scenario randomizes the variables and presents a unique operational and tactical problem for the player(s) to solve. From my experience, and feedback from players, the Tulane player achieves victory about 2 out of 5 games. There are also Theater Options added to this scenario which are designed to make the scenario balanced in the PBM genre. Can’t say that this 100% successful, but I have enjoyed all of the PBM games that I have played. Regards, RhinoBones
< Message edited by rhinobones -- 12/8/2007 5:33:56 AM >
|