Talk:Computer bridge

A fact from Computer bridge appeared on Wikipedia's Main Page in the Did you know column on 31 July 2006. The text of the entry was as follows:

Did you know... that a bridge-playing robot managed to defeat two reigning European bridge champions?

A record of the entry may be seen at Wikipedia:Recent additions/2006/July.

Wikipedia

Contract bridge Mid‑importance

	This article is within the scope of WikiProject Contract bridge, a collaborative effort to improve the coverage of Contract bridge on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Contract bridgeWikipedia:WikiProject Contract bridgeTemplate:WikiProject Contract bridgeContract bridge articles
Mid	This article has been rated as Mid-importance on the project's importance scale.

Properties of double-dummy...[edit]

Please do not delete this section right away. I added it for lack of a dedicated article on double-dummy solver, because I feel there are some things to be said on the matter. I am aware of the lack of references, however I think experts will agree that what I write is well-known facts and not original research.

Regarding Ginsberg and partition search, I have read his paper(s) on it, and I might be able to contribute a proper reference if noone else does it faster.

(Anders Hallström, still unregistered) 85.230.254.123 (talk) 02:19, 7 January 2013 (UTC)[reply]

External links modified[edit]

Hello fellow Wikipedians,

I have just modified one external link on Computer bridge. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Added archive https://web.archive.org/web/20060514115301/http://msoworld.com/mindzine/news/bridge/reviews/misc/man.html to http://www.msoworld.com/mindzine/news/bridge/reviews/misc/man.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 21:04, 11 August 2017 (UTC)[reply]

Regarding mathematical hardness[edit]

In the section "Comparison...", the bullet about Bridge being "hard" in a complexity class or not, it says:

However, since there is no natural structure to exploit in double-dummy bridge towards a hardness proof or disproof, unlike in a board game, the question of hardness remains.

Perhaps the wrong place to say this, but a natural expandable structure that comes to mind is a card deck of 4 suits times x cards of increasing value in each suit. Normally x=13 but theoretically the same game could be played for any x. I would imagine (it's just a hunch) that this game has the same hardness as chess. Certainly the search task grows exponentially with x.

True bridge with incomplete information is most likely "harder", but how to model that I don't know.

(Anders Hallström) 83.227.125.79 (talk) 13:43, 25 November 2022 (UTC)[reply]