Journal of Logic Programming - Logic programming applications
An adaption of proof-planning to declarer play in bridge
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Representations and solutions for game-theoretic problems
Artificial Intelligence - Special issue on economic principles of multi-agent systems
Search in games with incomplete information: a case study using Bridge card play
Artificial Intelligence
Finding optimal strategies for imperfect information games
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Search and Planning under Incomplete Information: A Study Using Bridge Card Play
Search and Planning under Incomplete Information: A Study Using Bridge Card Play
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A Defense Model for Games with Incomplete Information
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Randomized sampling for large zero-sum games
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
We investigate the best defence model of an imperfect information game. In particular, we prove that finding optimal strategies for this model is NP-complete in the size of the game tree. We then introduce two new heuristics for this problem and show that they outperform previous algorithms. We demonstrate the practical use and effectiveness of these heuristics by testing them on random game trees and on a hard set of problems from the game of Bridge. For the Bridge problem set, our heuristics actually outperform the human experts who produced the model solutions.