Comparing Minimax and Product in a Variety of Games.
| dc.contributor.author | Chi, Ping-Chung | en_US |
| dc.contributor.author | Nau, Dana S. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:38:00Z | |
| dc.date.available | 2007-05-23T09:38:00Z | |
| dc.date.issued | 1987 | en_US |
| dc.description.abstract | In 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.extent | 602637 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4612 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1987-104 | en_US |
| dc.title | Comparing Minimax and Product in a Variety of Games. | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1