德州扑克玩法卡的问题

1视图(30天)
约翰尼
约翰尼 2014年2月19日
编辑: 约翰尼2014年2月20日
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
函数CardMatrix = Texas_HoldEm (card1 card2)卡= {“A”、“K”、“问”、“J”,“10”,“9”, ' 8 ', ' 7 ', ' 6 ', ' 5 ', ' 4 ', ' 3 ', ' 2 '};
适合= {' S ', ' D ', ' H ', ' C '};
NumSuits =长度(套装);
NumCards =长度(卡);
%解析玩家1的卡片
PlayersCards = 0 (1、2);
PlayersCards (1) = GetCard (card1);
PlayersCards (2) = GetCard (card2);
如果PlayersCards (1) = = PlayersCards (2)
错误(“玩家1必须是两个不同的牌”)
结束
%组织玩家1的牌变成一个矩阵
CardMatrix = 0 (4、13);
CardMatrix (PlayersCards) = 1;
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
%获得卡与卡字符串
函数卡= GetCard (cardStr)
如果isempty (cardStr)
卡= 0;
其他的
cardNum =找到(strcmpi(卡片,cardStr (1: (end-1))));
西装=找到(strcmpi(西装、cardStr(结束)));
如果((长度(cardNum) ~ = 1) | |(长度(套装)~ = 1))
卡= 0;
其他的
卡=西装+ (cardNum - 1) * NumSuits;
结束
结束
结束
结束
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
> >我想我得到了第一个任务,但我想知道如何使它更简单,同时声明和初始化可能吗?
信谊numPairs
信谊数组
信谊probPair
numPairs = 0;
数组= 0;
probPair = 0;
numRows =大小(CardMatrix, 1);%的行数
%崩溃矩阵由加法沿行成一个数组
因为我= 1:numRows;
数组= CardMatrix(我:)+数组;
结束;
%计算可能的对,P2的数量
j = 1:长度(数组);
numPairs = nchoosek (numRows -数组(j), 1) + numPairs;
结束;
%确定P2有一对的概率
probPair = numPairs / nchoosek (50, 2)
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
我现在困在task 2 . .谁能给我一些提示吗?

答案(0)

类别

找到更多的在纸牌游戏帮助中心文件交换

社区寻宝

找到宝藏在MATLAB中央,发现社区如何帮助你!

开始狩猎!