c#检查扑克直道
本文关键字:扑克 检查 | 更新日期: 2023-09-27 18:08:12
我正在尝试用c#编写一个扑克牌手评估方法。除了直牌外,我已经对所有使用linq的牌手都做到了这一点。对于那些不打直牌的玩家,由5张牌组成,每张牌加1。a可以是高也可以是低。
我已经创建了一个名为card的对象,它有花色、秩和值(J = 11, Q =12等)。我的方法将被传递一个包含7张牌的对象列表(孔牌和棋盘)
另一件要记住的事情是,只有当玩家拥有5或10时,才能打出直牌。
见下面我的方法其他扑克手,请让我知道,如果你有一个想法的直接方法。伪代码也可以。
public bool CheckPair(List<Card> cards)
{
//see if exactly 2 cards card the same rank.
return cards.GroupBy(card => card.Rank).Count(group => group.Count() == 2) == 1;
}
public bool CheckTwoPair(List<Card> cards)
{
//see if there are 2 lots of exactly 2 cards card the same rank.
return cards.GroupBy(card => card.Rank).Count(group => group.Count() >= 2) == 2;
}
public bool CheckTrips(List<Card> cards)
{
//see if exactly 3 cards card the same rank.
return cards.GroupBy(card => card.Rank).Any(group => group.Count() == 3);
}
public bool CheckStraight(List<Card> cards)
{
// order by decending to see order
var cardsInOrder = cards.OrderByDescending(a => a.Value).ToList();
// check for ace as can be high and low
if (cardsInOrder.First().Rank == "A")
{
// check if straight with ace has has 2 values
bool highStraight = cards.Where(a => a.Rank == "K" || a.Rank == "Q" || a.Rank == "J" || a.Rank == "10").Count() == 4;
bool lowStraight = cards.Where(a => a.Rank == "2" || a.Rank == "3" || a.Rank == "4" || a.Rank == "5").Count() == 4;
// return true if straight with ace
if (lowStraight == true || highStraight == true)
{
return true;
}
}
else
{
// check for straight here
return true;
}
// no straight if reached here.
return false;
}
public bool CheckFlush(List<Card> cards)
{
//see if 5 or more cards card the same rank.
return cards.GroupBy(card => card.Suit).Count(group => group.Count() >= 5) == 1;
}
public bool CheckFullHouse(List<Card> cards)
{
// check if trips and pair is true
return CheckPair(cards) && CheckTrips(cards);
}
public bool CheckQuads(List<Card> cards)
{
//see if exactly 4 cards card the same rank.
return cards.GroupBy(card => card.Rank).Any(group => group.Count() == 4);
}
// need to check same 5 cards
public bool CheckStraightFlush(List<Card> cards)
{
// check if flush and straight are true.
return CheckFlush(cards) && CheckStraight(cards);
}
这可能不是性能最好的检查,但我想说它非常可读,这通常是一个很好的属性。
只要抓5张牌,跳过你已经看到的每一次迭代的牌,并检查每个序列的直线。如果一个有序序列不包含双精度,且第一张牌和最后一张牌的差值为5,则该序列为直序列。
public bool CheckStraight(List<Card> cards)
{
//maybe check 5 and 10 here first for performance
var ordered = cards.OrderByDescending(a => a.Value).ToList();
for(i = 0; i < ordered.Count - 5; i++) {
var skipped = ordered.Skip(i);
var possibleStraight = skipped.Take(5);
if(IsStraight(possibleStraight)) {
return true;
}
}
return false;
}
public bool IsStraight(List<Card> fiveOrderedCards) {
var doubles = cards.GroupBy(card => card.Rank).Count(group => group.Count() > 1);
var inARow = cards[4] - cards[0] = 5; //Ace is 0
return !doubles && inARow;
}
我对Glubus的答案做了一些小改动。下面的代码完成了这项工作,但是您必须手动检查轮子(a,1,2,3,4,5)的直线。
public bool CheckStraight(List<Card> cards)
{
//maybe check 5 and 10 here first for performance
var ordered = cards.OrderByDescending(a => a.Value).ToList();
for (var i = 0; i < ordered.Count - 4; i++)
{
var skipped = ordered.Skip(i);
var possibleStraight = skipped.Take(5).ToList();
if (IsStraight(possibleStraight))
{
return true;
}
}
return false;
}
public bool IsStraight(List<Card> cards)
{
return cards.GroupBy(card => card.Value).Count() == cards.Count() && cards.Max(card => (int)card.Value) - cards.Min(card => (int)card.Value) == 4;
}
,
function bool IsStraight(IEnumerable<int> cards)
{
var orderedCards = cards.OrderBy(n => n).ToList();
var test = orderdCards.Zip(orderdCards.Skip(1), (a, b) => b - a);
var count = 0;
foreach(var n in test)
{
if (n == 1)
{
count++;
if (count == 4)
{
return true;
}
}
else
{
count = 0;
}
}
return false;
}
我不能考虑真正的一行,因为A可以是1或14,但这应该是好的:
int c = 5; // How many cards straight
bool Ais1 = cards.OrderBy(a => a.Value).Select((i,j) => i.Value-j).Distinct().Skip(1).Count() <= (cards.Count - c);
bool Ais14 = cards.OrderBy(a => (a.Value == 1 ? 14 : a.Value)).Select((i,j) => (i.Value == 1 ? 14 : i.Value)-j).Distinct().Skip(1).Count() <= (cards.Count - c);
return Ais1 || Ais14;
(更新-谢谢你Janne,我已经修复了代码)