>Do we have a code repository up yet?

Yes. You can browse the cvs archive at www.pokersource.org.

>Is there a more elegant way of
>handling Omaha showdowns than examining SIXTY potential high hands and some
>number of lows approaching that?

You can cut the number of evaluations in something like half by doing the
following:

Call the evaluator with all nine cards (four hole cards plus five flop
cards). Call the result "IN" (for "ignorant nuts" -- the nuts if you were
playing 4-card hold-em). (The general evaluator will accept nine card
hands.) Then, iterate through the combinations. Compute the maximum value
of these, stopping if you get IN as a result. I think this will be the
case most of the time, and on average you should hit it halfway through the
iterations.

I was planning on writing a set of macros for dealing with Omaha hands, but
I never got around to it...

You can optimize the brute-force approach for low, by:
a) compute RL = ranks(the-board) OR (A-2-3-4-5-6-7-8)
and don't proceed if (n_bits_set[RL] < 3)
b) When computing the combinations, only use low cards from the board and
from the hands. This will cut down the combinations substantially.



--
Brian Goetz
Quiotix Corporation
brian@... Tel: 650-843-1300 Fax: 650-324-8032

http://www.quiotix.com