Skip to main content
SpringerLink
Log in

Search and Planning Under Incomplete Information

A Study Using Bridge Card Play

  • Book
  • © 1998

Overview

Authors:
  1. Ian Frank

    1. Electrotechnical Laboratory, Tsukuba-shi, Ibaraki-ken, Japan

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Distinguished Dissertations (DISTDISS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages i-xix
    Download chapter PDF

  2. Introduction

    • Ian Frank
    Pages 1-8

  3. A Good Deal of Bridge Literature

    • Ian Frank
    Pages 9-25

  4. Planning Literature

    • Ian Frank
    Pages 27-43

  5. The Bridge Search Space Size

    • Ian Frank
    Pages 45-58

  6. Proof-planning: Solving Independent Goals Using Tactics and Methods

    • Ian Frank
    Pages 59-88

  7. Search in Games with Incomplete Information

    • Ian Frank
    Pages 89-123

  8. Identifying The Best Strategy: Tackling Non-locality

    • Ian Frank
    Pages 125-158

  9. Interleaving Plans with Dependencies

    • Ian Frank
    Pages 159-198

  10. Re-introducing Neglected Actions

    • Ian Frank
    Pages 199-209

  11. Overall Architecture

    • Ian Frank
    Pages 211-224

  12. Results

    • Ian Frank
    Pages 225-243

  13. Conclusions

    • Ian Frank
    Pages 245-252

  14. Back Matter

    Pages 253-340
    Download chapter PDF
Back to top

Keywords

About this book

This book updates the thesis I produced for my PhD at the Department of Artificial Intelligence of the University of Edinburgh, correcting errors, and improving some of the formatting and readability. Since the original work was completed (early 1996), research has progressed. Most notably, the public profile of AI and game-playing has reached new heights with the feats of the chess computer DEEPER BLUE (which surely uses AI, no matter what IBM would have us believe). Although less heralded, the ability of computers to play Bridge (the main example domain in this book) has also increased. In July of 1997 a world championship for computer Bridge programs was hosted by the American Contract Bridge League in Albuquerque, New Mex­ ico. This contest was won by a program called Bridge Baron, produced by Great Game Products. Bridge Baron incorporates knowledge-based planning techniques developed by Stephen Smith and Dana Nau [1, 2]. Progress has also been made on the contrasting, more brute-force, approach of sampling the possible card distributions. In particular, Matt Ginsberg has developed a fast double-dummy solver based on partition search [3]. Ginsberg's program fared poorly in the 1997 Bridge championships, but Ginsberg himself reports very promising results [4] on a hard set of complete Bridge deals taken from the Bridge tutoring program Bridge Master.

Authors and Affiliations

  • Electrotechnical Laboratory, Tsukuba-shi, Ibaraki-ken, Japan

    Ian Frank

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation