scispace - formally typeset
Open AccessProceedings Article

Success in spades: using AI planning techniques to win the world championship of computer bridge

TLDR
The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League, and the winner was a new version of Great Game Products' Bridge Baron program, which uses Hierarchical Task-Network planning techniques.
Abstract
The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League. As reported in The New York Times and The Washington Post, the competition's winner was a new version of Great Game Products' Bridge Baron program. This version, Bridge Baron 8, has since gone on the market; and during the last three months of 1997 it was purchased by more than 1000 customers.The Bridge Baron's success also represents a significant success for research on AI planning systems, because Bridge Baron 8 uses Hierarchical Task-Network (HTN) planning techniques to plan its declarer play. This paper gives an overview of those techniques and how they are used.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Adversarial reasoning under uncertainty using a deterministic planner

TL;DR: A restricted subset of probabilistic reasoning is added to the authors' deterministic adversarial reasoning technique, RAPSODI, to strike a balance between the intractable complexities of computing a fully Probabilistic representation, versus the inadequate expressiveness of a simpler deterministic representation.

Adversarialreasoning under uncertainty using a deterministicplanner

TL;DR: A restricted subset of probabilistic reasoning is added to the authors' deterministic adversarial reasoning technique, RAPSODI, to strike a balance between the intractable complexities of computing a fully Probabilistic representation, versus the inadequate expressiveness of a simpler deterministic representation.
References
More filters
Journal ArticleDOI

Planning in a hierarchy of abstraction spaces

TL;DR: Examples of the ABSTRIPS system's performance are presented that demonstrate the significant increases in problem-solving power that this approach provides, and some further implications of the hierarchical planning approach are explored.
Proceedings Article

HTN planning: complexity and expressivity

TL;DR: How the complexity of HTN planning varies with various conditions on the task networks is described.
Proceedings Article

Generating project networks

TL;DR: The planner (NONLIN) and the Task Formalism (TF) used to hierarchically specify a domain are described, which can aid in the generation of project networks.
Proceedings Article

Planning in a hierarchy of abstraction spaces

TL;DR: Examples of the ABSTRIPS system's performance are presented that demonstrate the significant increases in problem-solving power that this approach provides, and some further implications of the hierarchical planning approach are explored.
Proceedings Article

UMCP: a sound and complete procedure for hierarchical task-network planning

TL;DR: This paper presents a formal syntax and semantics for HTn planning and is able to define an algorithm for HTN planning and prove it sound and complete.