本文和大家聊聊用JavaScript撰寫鬥地主的實作思路,程式碼寫得比較樸素,還請多多包涵。

先來談談鬥地主主要包含哪些功能:洗牌、發牌、玩家出牌、電腦出牌、出牌規則驗證等等。輸贏判斷這裡先不做,主要是把這幾個核心功能跑起來。下面依序說明各功能的實作:
var pukes=this.manage.pukes;//存放撲克牌的數組
//洗牌
for(var i=0;i<pukes.length;i++){
var tmp=pukes[i];
var index=util.random(i,pukes.length);//隨機交換兩張牌
pukes[i]=pukes[index];
pukes[index]=tmp;
}
(簡版預設玩家自己為地主,電腦為農民)由於洗牌時已經把牌的順序打亂,所以發牌只是簡單地循環,把 pukes 中的元素逐一放進每個玩家實例的 pukes 欄位裡。
//發牌
var start=0;
for(var i=0;i<this.manage.pukes.length-3;i++) {
if(start==this.manage.players.length){
start=0;
}
this.manage.pukes[i].status=true;
this.manage.players[start].pukesLen++;
this.manage.players[start++].pukes.push(this.manage.pukes[i]);
}
for(var i=this.manage.pukes.length-3;i<this.manage.pukes.length;i++){
//地主多三張
this.manage.pukes[i].status=true;
this.manage.players[this.manage.curPlayerIndex].pukesLen++;
this.manage.players[this.manage.curPlayerIndex].pukes.push(this.manage.pukes[i]);
}
出牌分為電腦和玩家兩個步驟,其中電腦出牌是非常「傻瓜」的方式(有牌就出):
//出牌
if(this.options.playerIndex==this.manage.curPlayerIndex) {
var spks = [],gz=false;
if (this.manage.curMaxPlayerIndex == this.options.playerIndex) {
this.manage.deskPukes = [];
}
if (this.isCompute) {
//電腦自動出牌
var start = 0;
var len=this.manage.deskPukes.length||0;
while (start < this.pukes.length) {
spks = [];
for (var i = 0,j=start; i <len&&j<this.pukes.length; i++) {
//隨便選一張 可以出就行
if(this.pukes[j].status) {
spks.push(this.pukes[j++]);
}
}
if(spks.length) {
if (rules.valids(spks, this.manage.deskPukes)) {
gz = true;
break;
}
}
start++;
}
} else {
//玩家選擇出牌
for (var i = 0; i < this.pukes.length; i++) {
if (this.pukes[i].selected && this.pukes[i].status) {
spks.push(this.pukes[i]);
}
}
if (rules.valids(spks, this.manage.deskPukes)) {
gz=true;
} else{
alert("出牌不符合規則!");
}
}
if(gz){
this.manage.curMaxPlayerIndex=this.options.playerIndex;
this.manage.deskPukes = [];
for (var i = 0; i < spks.length; i++) {
this.pukesLen--;
this.manage.deskPukes.push(spks[i]);
spks[i].status = false;
}
}
this.manage.renderPukes();
this.manage.renderCurDiscard();
if(this.isCompute||gz) {
this.manage.nextPlayer();
}
} else{
alert("沒輪到你出牌!");
}
規則驗證是由多個函數組合而成,透過循環逐一呼叫,只要遇到回傳 true 的規則即代表出牌合法:
//以下為出牌規則
var rules={
_rules:[
new danzRule(),
new duiRule(),
new sandRule(),
new zandRule(),
new shunzRule(),
new liandRule()
],
valids:function(_pukes,_curPukes){
for(var i=0;i<this._rules.length;i++){
if(this._rules[i].valid(_pukes,_curPukes)){
return true;
}
}
return false;
}
};
function danzRule(){ //單張規則 }
danzRule.prototype.valid=function(_pukes,_curPukes){
//校驗
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&pukes.length==1){
//比較牌面值
if(!curPukes||!curPukes.length){
return true;
}
if(curPukes[0].dians==14&&pukes[0].dians<14){
//特殊處理
return false;
}
if(pukes[0].dians==14&&curPukes[0].dians<14){
//特殊處理
return true;
}
return pukes[0].dians>curPukes[0].dians;
}
return false;
}
function duiRule(_pukes,_curPukes){ //兩張規則 }
duiRule.prototype.valid=function(_pukes,_curPukes){
//校驗
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&pukes.length==2){
//比較牌面值
if(pukes[0].dians>13&&pukes[0].dians>13){
return true;
}
if(pukes[0].dians!=pukes[1].dians){
return false;
}
if(!curPukes||!curPukes.length){
return true;
}else {
if(curPukes.length!=2){
return false;
}
if (curPukes[0].dians > 13 && curPukes[0].dians > 13 ) {
return false;
}
if (curPukes[0].dians != curPukes[1].dians) {
return false;
}
if (curPukes[0].dians == 14 ) {
return false;
}
}
if(pukes[0].dians==14){
return true;
}
return pukes[0].dians>curPukes[0].dians;
}
return false;
}
function sandRule(){ //三帶 }
sandRule.prototype.valid=function(_pukes,_curPukes){
//校驗
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&(pukes.length>=4)){
//比較牌面值
var books=getBooks(pukes);
if(!valid(books))return false;
if(!curPukes||!curPukes.length)return true;
if(curPukes.length!=books.length)return false;
var books=getBooks(curPukes);
if(!valid(books))return false;
return getSum(books)>getSum(books);
}
return false;
function getSum(books){
var sum=0;
for(var i=0;i<books.length;i++) {
if(books[i]==3){
if(i==0)return 0;
sum+=i;
}
}
return sum;
}
function valid(books){ //驗證三帶是否有效
var counts=0,countsd=0,d=true,start=false,startIndex=-1;
for(var i=0;i<books.length;i++) {
if(start&&books[i]==0&&startIndex!=(i-1)){
return false;
}else{
startIndex=i;
}
if(books[i]==3){
if(!start) {
start = true;
startIndex = i;
}
counts++;
}
if(books[i]==2){
d=false;
}
}
for(var i=0;i<books.length;i++) {
if(d&&books[i]==2){
countsd++;
} else if(!d&&books[i]==3){
countsd++;
}
}
return counts>0&&counts==countsd;
}
function getBooks(pukes){ //返回三帶的每個點數的個數
var books=[];
for(var i=0;i<pukes.length;i++){
if(!books[pukes[i].dians]){
books[pukes[i].dians]=1;
}else{
books[pukes[i].dians]++;
}
}
return books;
}
}
function zandRule(){ //炸彈 }
zandRule.prototype.valid=function(_pukes,_curPukes){
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&pukes.length==4) {
if(!allEqual(pukes)){
return false;
}
if(!curPukes||(curPukes.length>0&&curPukes.length!=4)||!allEqual(curPukes)){
return true;
} else{
if(pukes[0].dians==14){
return true;
}
if(curPukes[0].dians==14){
return false;
}
return pukes[0].dians>curPukes[0].dians;
}
}
return false;
function allEqual(pukes){
if(!pukes||!pukes.length)return false;
var base=pukes[0].dians;
for(var i=0;i<pukes.length;i++){
if(base!=pukes[i].dians){
return false;
}
}
return true;
}
}
function liandRule(){ //連對 }
liandRule.prototype.valid=function(_pukes,_curPukes) {
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&pukes.length>=6) {
if(!verificationCoherence(pukes)){
return false;
}
if(!curPukes||curPukes.length<=0){
return true;
}
if(!verificationCoherence(curPukes)){
return false;
}
if(pukes.length!=curPukes.length){
return false;
}
return getSumDians(pukes)>getSumDians(curPukes);
}
return false;
function getSumDians(pukes){
var sum=0;
for(var i=0;i<pukes.length;i++) {
sum+=pukes[i].dians;
}
return sum;
}
function verificationCoherence(pukes){ //驗證連貫性
if(!pukes||!pukes.length)return false;
var books=[];
for(var i=0;i<pukes.length;i++){
if(pukes[i].dians==2||pukes[i].dians>14){
return false;
}
if(!books[pukes[i].dians]){
books[pukes[i].dians]=1;
}else{
books[pukes[i].dians]++;
}
if(books[pukes[i].dians]>2){
return false;
}
}
var start=false;
for(var i=0;i<books.length;i++) {
if(books[i]&&books[i]!=2){
return false;
}
if(books[i]==2&&!start){
start=true;
}
if(start&&books[i]!=2){
return false;
}
}
return true;
}
}
function shunzRule(){ //順子 }
shunzRule.prototype.valid=function(_pukes,_curPukes){
var pukes=_pukes;//玩家的牌
var curPukes=_curPukes;//左面的牌
if(pukes&&pukes.length>=5) {
if(!verificationCoherence(pukes)){
return false;
}
if(!curPukes||curPukes.length<=0){
return true;
}
if(!verificationCoherence(curPukes)){
return false;
}
if(pukes.length!=curPukes.length){
return false;
}
return getSumDians(pukes)>getSumDians(curPukes);
}
return false;
function getSumDians(pukes){
var sum=0;
for(var i=0;i<pukes.length;i++) {
sum+=pukes[i].dians;
}
return sum;
}
function verificationCoherence(pukes){ //驗證連貫性
if(!pukes||!pukes.length)return false;
var books=[];
for(var i=0;i<pukes.length;i++){
if(pukes[i].dians==2||pukes[i].dians>14){
return false;
}
if(!books[pukes[i].dians]){
books[pukes[i].dians]=1;
}else{
return false;
}
}
var start=false;
for(var i=0;i<books.length;i++) {
if(books[i]==0&&!start){
start=true;
}
if(start&&!books[i]){
return false;
}
}
return true;
}
}
以上這四步,是我認為最核心的四個部分。其他如初始化、事件註冊等函數,原始碼中已有註解,寫得不夠精緻之處還請見諒。
關於JavaScript實現鬥地主的思路就介紹到這裡,希望對大家有所幫助!