Fixed situation set

Oles (shared@astral.ntu-kpi.kiev.ua)
Wed, 24 Nov 1999 17:50:19 +0100 (MET)

Hi All.

I'd like to know more about "fixed situatiuon set" algorithms of AI.
May be my terminology isn't correct enought, so I'll try to explain.

The algorithm is generally designed for use in strategy games.
Each unit can be placed in a small set of situations in the restricted
rules of the game. This situations (or only part of them) are covered
in some database. On each move the unit finds the "best situation fit"
and than simply perform the action associated with choosen situation.
The main benefit of this alg. is that database can be unlimitedly expanded
and even reloaded in the allready running game.

Can anybody give me an extended information (and possibly documentation)
on this algorithm?

mailto: oles@astral.ntu-kpi.kiev.ua

PS. Sorry for my incredibly bad english :-(

############################################################################
This message was posted through the fuzzy mailing list.
(1) To subscribe to this mailing list, send a message body of
"SUB FUZZY-MAIL myFirstName mySurname" to listproc@dbai.tuwien.ac.at
(2) To unsubscribe from this mailing list, send a message body of
"UNSUB FUZZY-MAIL" or "UNSUB FUZZY-MAIL yoursubscription@email.address.com"
to listproc@dbai.tuwien.ac.at
(3) To reach the human who maintains the list, send mail to
fuzzy-owner@dbai.tuwien.ac.at
(4) WWW access and other information on Fuzzy Sets and Logic see
http://www.dbai.tuwien.ac.at/ftp/mlowner/fuzzy-mail.info
(5) WWW archive: http://www.dbai.tuwien.ac.at/marchives/fuzzy-mail/index.html