poker

问题 I am looking for an elegant(fast) python function that produces every combination from the following two arrays. cards = ["8H", "8S", "8C", "8D", "9H", "9S", "9C", "9D", "10H", "10S", "10C", "10D", "AH", "AS", "AC", "AD"] players = ["_1", "_1", "_1", "_2", "_2", "_2", "_3", "_3", "_3", "_4", "_4", "_4", "_To", "_To", "_To", "_Tc"] A combination would look like: [('8H', '_1'), ('8S', '_1'), ('8C', '_1'), ('8D', '_2'), ('9H', '_2'), ('9S', '_2'), ('9C', '_3'), ('9D', '_3'), ('10H', '_3'), ('10S

问题 In another question I learned how to calculate straight poker hand using regex (here). Now, by curiosity, the question is: can I use regex to calculate the same thing, using ASCII CODE? Something like: regex: [C][C+1][C+2][C+3][C+4], being C the ASCII CODE (or like this) Matches: 45678 , 23456 Doesn't matches: 45679 or 23459 (not in sequence) 回答1: Your main problem is really going to be that you're not using ASCII-consecutive encodings for your hands, you're using numerics for non-face cards,

问题 I’ve learned Java for 1 month. This time, I’d like to create a poker game. There are two questions about my program. I hope somebody can help me to fix it. Each card has it value, for A as 1, king as 10, but I find out that this is a String array. How could I give each “String value “as “int value” so that I can do the operation? String[] suits = { "hearts", "spades", "diamonds", "clubs" }; String[] number = {"A","2","3"......}; I hope this system can use random number to chose cards at first

问题 I am trying to write a poker hand evaluation method in c#. I have managed to do this for every poker hand using linq except a straight. For those that don't play a straight is made up of 5 cards with increments of 1 for each card. Ace can be high or low. I have created an object called card which has a suit, rank and value (J = 11, Q =12 etc..). My method will be passed a list of this object containing 7 cards (hole cards and the board.) Another thing to bear in mind is that a straight can

问题 I'm writing a 7 card poker hand evaluator as one of my pet projects. While trying to optimize its speed (I like the challenge), I was shocked to find that the performance of Dictionary key lookups was quite slow compared to array index lookups. For example, I ran this sample code that enumerates over all 52 choose 7 = 133,784,560 possible 7 card hands: var intDict = new Dictionary<int, int>(); var intList = new List<int>(); for (int i = 0; i < 100000; i ++) { intDict.Add(i, i); intList.Add(i)

问题 I am thinking about poker hand (5 cards) evaluation in Java . Now I am looking for simplicity and clarity rather than performance and efficiency. I probably can write a "naive" algorithm but it requires a lot of code. I saw also a few poker evaluation libraries, which use hashing and bitwise operations, but they look rather complex. What is the "cleanest and simplest" algorithm for poker hand evaluation ? 回答1: Here is a very short but complete histogram based 5 card poker scoring function in

问题 Im a beginner with C++ and this is for homework but Im stuck. I have one remaining problem and then im finished. I can'T think of an algorithm that will tell if the user entered a small straight (1234) or (2345) or (3456). I know how to do it using a loop but is it possible to not use a loop? When this was assigned, we did not learned about loops yet. I think we are only suppose to use if statements. I started coding for it (I wrote what the dice can be, but cant figure out how to let only 4

问题 I am writing a python program just to make a simple poker game. I just want to become familiar with the Python language. I know my method of writing the python code isn't exactly Pythonic but really I'm just trying to figure out why my list is appending the last object repeatedly to each space in the List. As I am appending, the list has the correct values but after it just appends the last object repeatedly. I've spent about two days trying to figure it out and I'm sure it's just something I

问题 I am making a Poker game in C++, and I am just trying to get started. I need the ability to compare "Hands", to see which one is greater, equal, or lesser. So, I have a Hand class now, and I made two other sub-classes that are called Straight and ThreeOfKind (I will add the rest later. The Hand class has a method called compareTo(Hand* otherHand) , it then checks the hand ranking to see which one is better. Also, with the Straights and Three of a Kinds, you can compare them together when they

问题 This question already has answers here : Closed 8 years ago . Possible Duplicate: How to iteratively generate k elements subsets from a set of size n in java? I want to build my own poker hand evaluator but am having trouble with a particular part. If two players get dealt a two card hand, then there will be 48 cards left in the pack. In Texas Hold'em a further 5 possible community cards are then dealt (this is called the board). I want to enumerate / loop through all the 48 choose 5 possible