Search the web
Sign In
New User? Sign Up
pokersource · Poker Source
  • Members Only
  • Post
  • Files
  • Photos
  • Links
  • Database
  • Polls
  • Members
  • Calendar
  • Promote
  • Groups Labs (Beta)
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

   Messages Help
Message #
Search:
Advanced
2+2 thread on super fast evaluators   Message List  
Reply | Forward Message #327 of 355 |
There is a fascinating thread on 2+2 about building the next
generation of poker hand evaluators. Several posters have reported
7-card hand eval rates well over 100M hands per second. The
approaches use "a lot" of memory, but nothing you would notice on your
desktop box.

The thread is here:
http://forumserver.twoplustwo.com/showflat.php?Number=8648777&fpart=all

-Michael M
Thu Jan 4, 2007 3:28 am

Show Message Option
mjmaurer
Online Now Online Now
Send Email Send Email

Forward 		Message #327 of 355 |
Expand Messages Author Sort by Date

There is a fascinating thread on 2+2 about building the next generation of poker hand evaluators. Several posters have reported 7-card hand eval rates well... 		Michael Maurer
mjmaurer
Online Now Send Email 		Jan 4, 2007
3:44 am

Quite some time ago, "Cactus Kev" created a webpage about his fast 5-card hand eval: http://www.suffecool.net/poker/evaluator.html It exploits the equivalence...
Darse Billings
rayzor04
Offline Send Email 		Jan 4, 2007
2:28 pm

Actually in under 10 cycles per hand... ;-) High Card = 23294460 Pair = 58627800 Two Pair = 31433400 Three of a Kind = 6461620 Straight = 6180020 Flush =...
Ray
ramonwotton
Offline Send Email 		Jan 4, 2007
3:45 pm

That's awesome, Ray. I'm experiencing awe. ;-) Can we squeeze this some more by *first* thinking about the fastest possible hash index functions, and then...
Darse Billings
rayzor04
Offline Send Email 		Jan 4, 2007
4:30 pm

... Specifically: 2c 001000 2d 001001 2h 001010 2s 001011 3c 001100 3d 001101 3h 001110 3s 001111 4c 010000 4d 010001 4h 010010 4s 010011 5c...
Darse Billings
rayzor04
Offline Send Email 		Jan 4, 2007
6:04 pm

... If you're going to do a table lookup, is there some significant advantage from the binary representation over, say, index = card0+52*(card1 + 52*(card2 ......
Jeffrey Siegal
jsiegal
Offline Send Email 		Jan 4, 2007
7:24 pm

Having suggested the bit-friendly representation, I'm now working on making it obsolete. :) If we roll-up the cards 6 bits at a time and compose a 4-card...
Darse Billings
rayzor04
Offline Send Email 		Jan 4, 2007
8:16 pm

Actually, I wrote some C++ code to do exactly this - I actually worked out a minimal perfect hash for the representations. Basically, an evaluation is a sort...
Jim Laird
sn0rt2001
Offline Send Email 		Feb 16, 2007
5:20 pm

I did almost the same thing about 12 years ago when CPU cycles and RAM were more expensive. I created a table that returned a two values, one if the hand was...
Ken Anderson
ken_anderson...
Offline Send Email 		Jan 4, 2007
6:17 pm

Most people on this list won't need any further explanation of Mike White (mykey1961?) and Ray Wotten's approach. But in case it helps at all, here's a post I...
Darse Billings
rayzor04
Offline Send Email 		Jan 9, 2007
8:05 pm
< Prev Topic  |  Next Topic >
Message #
Search:
Advanced
Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help