Re: Search for an algorithm to deal cards with preset conditions

Volker Lenhardt wrote:
stan schrieb:

http://www.rpbridge.net/7z68.htm

Which seems to cover the probability issue. I can't vouch or the
correctness of anything on the site, but on a quick glance it does seem
viable.

Wonderful. Many thanks. And his randomizing techniques:
http://www.rpbridge.net/7z71.htm

I saw that one also. I bookmarked the site for later perusal as time
permits. Seems like an interestng solution.

I wonder why I didn't find these sites by myself.

Can't say. The search I think I used was "algorithms deal cards" I was
actually looking for something I thought I remembered from the past in a
Communications of the ACM algorithm column. I never found what I was
looking for but I did come accross an improvement on the "twiddle" m of n
things combinations algorithm. I was aware of twiddle but I didn't know
about the improvement so the time was well spent and it looks like it
benefited both of us.

I think this gets me working.

Thanks to all for your help and your patience.

You are very welcome, I'm glad it helped.
.

Relevant Pages

  • Re: Blowfish Sign Extension implementation risk
    ... Usual approach is to specify the algorithm in a computer-understandable ... Some people work on proofs of program correctness: ... with more low-level languages like C, ... one could try to design the algorithm ...
    (sci.crypt)
  • Re: JSH: Weird feeling
    ... I recall, back when you claimed to find a polynomial algorithm for TSP, that you gave "proofs" of correctness for your algorithms, algorithms that were later shown to be incorrect. ... My family's too spread out to be killed with a bomb. ... Intelligence services need to note that I have ...
    (sci.math)
  • Re: Hash functions (was: Maximum String size in Java?)
    ... > "Even though a hash table is a fairly wonderful data structure, ... correctness are, which implies simplicity and consistency of the ... It doesn't take long for an Oalgorithm to become unusable, ... the broken "Reply" link at the bottom of the article. ...
    (comp.programming)
  • Re: puzzle
    ... >>>such an algorithm is when n is very small so there is no need to perform ... >>>any other optimizing tricks. ... Tricks and algorithms) the Xor solution is unacceptable. ... but we were not talking about correctness but about execution speed. ...
    (comp.programming)
  • Re: Proof of Algorithm correctness
    ... >>sort algorithm), but want to see a proof for substantial programs. ... >>prove program correctness in certain cases, ... written in a first order language - then show that the invariant is ... a few first order expressions: one that describes the necessary state ...
    (sci.math.research)