Partition search

Conference · Tue Dec 31 00:00:00 EST 1996

OSTI ID:430660

Ginsberg, M L ^[1]

---

1. CIRL, Eugene, OR (United States)

We introduce a new form of game search called partition search that incorporates dependency analysis, allowing substantial reductions in the portion of the tree that needs to be expanded. Both theoretical results and experimental data are presented. For the game of bridge, partition search provides approximately as much of an improvement over existing methods as {alpha}-{beta} pruning provides over minimax.

• OSTI ID: 430660
• Report Number(s): CONF-960876-; TRN: 96:006521-0035
• Resource Relation: Conference: 13. National conference on artifical intelligence and the 8. Innovative applications of artificial intelligence conference, Portland, OR (United States), 4-8 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the thirteenth national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference. Volume 1 and 2; PB: 1626 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
GAME THEORY
ARTIFICIAL INTELLIGENCE
DECISION TREE ANALYSIS
ALGORITHMS
INFORMATION RETRIEVAL