Comparing Minimax and Product in a Variety of Games.

Simple item page
dc.contributor.authorChi, Ping-Chungen_US
dc.contributor.authorNau, Dana S.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:38:00Z
dc.date.available2007-05-23T09:38:00Z
dc.date.issued1987en_US
dc.description.abstractIn applications of game tree searching, the most widely used back-up rule is the minimax rule. Research has shown that minimax does not perform well in some games - and this has led to interest in alternatives to minimax, such as the product rule.en_US
dc.format.extent602637 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4612
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-104en_US
dc.titleComparing Minimax and Product in a Variety of Games.en_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_87-104.pdf
Size:
588.51 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports