English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Finesse: An Adaptation of Proof‐planning to Declarer Play in Bridge

MPS-Authors
/persons/resource/persons44075

Basin,  David
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44204

Bundy,  Alan
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Frank, I., Basin, D., & Bundy, A. (1992). Finesse: An Adaptation of Proof‐planning to Declarer Play in Bridge. In B. Neuman, & W. Horn (Eds.), ECAI 1992 (pp. 72-76). Vienna, Austria: Wiley.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0023-C414-0
Abstract
We present FINESSE, a system that forms optimal plans for declarer play in the \u000Agame of Bridge. FINESSE adapts the technique of proof‐planning, developed at \u000AEdinburgh University in the context of mathematical theorem‐proving, to deal \u000Awith the disjunctive choice encountered when planning under uncertainty, and \u000Athe context‐dependency of actions produced by the presence of an opposition. \u000AFINESSE not only demonstrated how the idea of proof‐planning could be \u000Ageneralised, but also proved to be a very capable bridge system. In its domain \u000Aof planning for individual suits, it correctly identified the proper lines of \u000Aplay found in many examples from the Bridge literature, supporting its \u000Adecisions with probabilistic and qualitative information. Caes were even \u000Adiscovered in which FINESSE revealed errors in the analyses presented by \u000Arecognized authorities.