Talk:Computer bridge

Properties of double-dummy...
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)

External links modified
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.

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

Regarding mathematical hardness
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)