Computer bridge

About: Computer bridge is a research topic. Over the lifetime, 37 publications have been published within this topic receiving 617 citations.

Recent Developments on Computer Bridge Analysis and Design

Abstract: Because of the many advances and development in bridge analysis and design, particularly in the area of numerical modelling and computer analysis that have occurred since the advent of the digital computer, previously considered challenging and increasingly more complex highway bridges are now regularly built around the world. These advances oupled with the development of increasingly powerful computers and the fast reducing cost of computing will have significant influence on the future practice of bridge engineering, and also structural engineering in general. This paper presents an overview of some of these developments and the recent trends in bridge modelling and analysis. Language: en

Recursive Monte Carlo Search for Bridge Card Play

Abstract: Computer Bridge remains a challenging obstacle for Artificial Intelligence. For the last twenty years, the state-of-the-art playing programs have been using a depth-one Monte Carlo (MC) search approach, associated with an open card solver called Double Dummy Solver (DDS). When increasing the computing resources, the MC approach reaches a plateau, and its playing level cannot be improved. In this work, we study Recursive MC (RMC) for Bridge card play. We show that, with more computing resources, this approach performs better than MC. Rather than using DDS or any domain-dependent simulator, a level N + 1 RMC consists in using a level N RMC playing program as simulator, level-zero RMC being MC. This recursion mechanism can be iterated several times at the cost of increasing the computing time, each time a recursion level is added. This work focusses on card play with no trump in duplicate with either 13 cards per player or 5 cards per player. With 13 cards per player, level-one RMC is superior to MC with a margin of 0.5 trick per card distribution on average, which is statistically significant. This is the first time RMC is applied with success to computer Bridge card play.

Application of abduction to computer bridge

Abstract: This paper proposes a method using the hypothetical reasoning for locating missing high cards in the game of bridge. Beginner knowledge for bidding and leading cards is represented by constraint logic programming language CHIP. Observation as to whether one leads with the king of hearts is given as a part of query. Then hypothesizing as to the possession of the ace of hearts is generated by abduction and integrity constraints are checked by consistency techniques in CHIP. A system based on beginners' knowledge is as powerful as an expert system used for the same purpose.

Patient data information system

Abstract: The invention relates to a patient data information system that is composed of local computers and has the following features: every place of work of a participating doctor or hospital is connected to a connected, tunneled network via a local bridge computer; the data associated with the place of work are stored in the bridge computer so as not to be modified inasmuch as they can only be read and completed; the network is associated with an index computer in which the identification features of the individual patients can be input; the index computer merges the bridge computers relevant for the data inquiry by means of said identification features and disconnects itself.