Article View: sci.math.stat
Article #348Re: FULL HOUSE (REVISED)
From: Arthur Rubin
Date: Tue, 15 Sep 1992 21:27
Date: Tue, 15 Sep 1992 21:27
25 lines
1527 bytes
1527 bytes
In <1992Sep13.185343.26823@wuecl.wustl.edu> ppc1@cec1.wustl.edu (Peter Pui Tak Chiu) writes: >// this previous version of this program assumes that we are drawing from >// an infinite deck. (which is a bug). >// now this version has no such problem... >// but still the probability is around 0.004... >// which is four times the theoretical value 0.001441 The program looks more or less correct, although I only know C rather than C++ so I can't verify the output line, but... The low order bits of random numbers are freqently systematic. If, for instance, the low 2 bits of rand move systematically among the suits with period 4, and, assuming the remaining bits are sufficiently random (possibly true), we would have the probablity of a full house (2/13)^3 = .00364 -- Arthur L. Rubin: a_rubin@dsg4.dse.beckman.com (work) Beckman Instruments/Brea 216-5888@mcimail.com 70707.453@compuserve.com arthur@pnet01.cts.com (personal) My opinions are my own, and do not represent those of my employer. My interaction with our news system is unstable; please mail anything important.
Technical Details
Message-ID:
<a_rubin.716592445@dn66>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!network.ucsd.edu!mvb.saic.com!unogate!beckman.com!dn66!a_rubinReferences:
<1992Sep13.185343.26823@wuecl.wustl.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!news.acns.nwu.edu!network.ucsd.edu!mvb.saic.com!unogate!beckman.com!dn66!a_rubin Newsgroups: sci.math.stat Subject: Re: FULL HOUSE (REVISED) Message-ID: <a_rubin.716592445@dn66> From: a_rubin@dsg4.dse.beckman.com (Arthur Rubin) Date: 15 Sep 92 21:27:25 GMT References: <1992Sep13.185343.26823@wuecl.wustl.edu> Nntp-Posting-Host: dn66.dse.beckman.com Lines: 25