Skip to Main Content
Automated Planning
book

Automated Planning

by Malik Ghallab, Dana Nau, Paolo Traverso
May 2004
Intermediate to advanced content levelIntermediate to advanced
635 pages
19h 46m
English
Morgan Kaufmann
Content preview from Automated Planning
23.3 Game-Tree Search in Bridge 519
for various possible card plays by the opponents. Thus, rather than being a single
linear sequence of moves, the plan is more like a tree structure (see Section 23.3).
The plan is normally a combination of various stratagems for trying to win tricks.
There are a number of well-known stratagems, which have names like ruffing, cross-
ruffing, finessing, cashing out, discovery plays, and so forth (Section 23.4 gives an
example). The ability of a bridge player depends partly on how skillfully he or she
can plan and execute these stratagems. This is especially true for the declarer, who
is responsible for playing both his or her cards and the dummy’s cards.
23.3 Game-Tree Search in Bridge
Game-tree search is a technique
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Communicate with Teams More Effectively

Communicate with Teams More Effectively

Charles Humble
How to Overcome a Power Deficit

How to Overcome a Power Deficit

Cyril Bouquet, Jean-Louis Barsoux

Publisher Resources

ISBN: 9781558608566