python編寫紮金花小程序的實例代碼

Posted on by

遊戲規則：

一付撲克牌，去掉大小王，每個玩傢發3張牌，最後比大小，看誰贏。

有以下幾種牌：

豹子：三張一樣的牌，如3張6.

順金：又稱同花順，即3張同樣花色的順子， 如紅桃 5、6、7

順子：又稱拖拉機，花色不同，但是順子，如紅桃5、方片6、黑桃7，組成的順子

對子：2張牌一樣

單張：單張最大的是A

這幾種牌的大小順序為， 豹子>順金>順子>對子>單張

程序需要實現的點：

  1. 先生成一付完整的撲克牌
  2. 給5個玩傢隨機發牌
  3. 統一開牌，比大小，輸出贏傢是誰

主要思路：

 把各種牌用積分來計算，最後加上三張牌的基礎積分。即：最終積分=基礎積分+牌型積分。最後比較最紅積分，誰的積分大，誰排名就靠前。 附上源碼：

# -*- coding: utf-8 -*-
"""
# @Time   : 2021-01-07 14:55
# @author  : jianwei
# @Software : PyCharm
"""

import random
import operator

puke = [] # 存儲撲克牌
num_list = ['2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A']
hua_list = ['梅花', '紅桃', '黑桃', '方塊']
sotr_dic = {'2': 0, '3': 1, '4': 2, '5': 3, '6': 4, '7': 5, '8': 6, '9': 7, '10': 8, 'J': 9, 'Q': 10, 'K': 11, 'A': 12,
      '對子': 15, '順子': 30, '順金': 60, '豹子': 100}
count_new_list = [] # 存儲玩傢分數和排序後排名
count_dic = {} # 存儲玩傢分數
# 準備52張撲克
for hua in hua_list:
  for num in num_list:
    a = hua + num
    puke.append(a)
player_dic = {'玩傢1': [], '玩傢2': [], '玩傢3': [], '玩傢4': [], '玩傢5': []}
# 隨機給五個玩傢發牌
# print(len(puke))
for key, value in player_dic.items():
  for i in range(3):
    plate = random.sample(puke, 3)
    player_dic[key] = plate
    for i in plate:
      puke.remove(i)


# print(player_dic)

# 獲取玩傢的牌型
def paixing(list1):
  num = []
  huase = []
  for i in list1:
    a = i[2:]
    b = i[:2]
    num.append(a)
    huase.append(b)
  return num, huase


# 對數字的牌型進行排序
def sotr(num):
  new_num = []
  sort_list2 = []
  list1 = []
  for i in num:
    new_num.append(sotr_dic[i])
  new_num = sorted(new_num)
  for new in new_num:
    sort_list2.append([k for k, v in sotr_dic.items() if v == new])
  for m in sort_list2:
    for n in m:
      list1.append(n)
  return list1


# 對玩傢的牌形統計分數
def count(num, huase):
  a = 0
  base_count = sotr_dic[num[0]] + sotr_dic[num[1]] + sotr_dic[num[2]]
  if num[0] == num[1] and num[1] == num[2]:
    paixing = '豹子'
    a = base_count + sotr_dic[paixing]
    # print(paixing, a)
  elif (sotr_dic[num[0]] + 1 == sotr_dic[num[1]] and sotr_dic[num[2]] - 1 == sotr_dic[num[1]]) and (huase[0] == huase[
    1] and huase[1] == huase[2]):
    paixing = '順金'
    a = base_count + sotr_dic[paixing]
    # print(paixing, a)
  elif (sotr_dic[num[0]] + 1 == sotr_dic[num[1]]) and (sotr_dic[num[2]] - 1 == sotr_dic[num[1]]) and (
      huase[0] != huase[
    1] or huase[1] != huase[2]):
    paixing = '順子'
    a = base_count + sotr_dic[paixing]
    # print(paixing, a)
  elif (num[0] == num[1] and num[1] != num[2]) or (num[1] == num[2] and num[0] != num[1]) or (
      num[0] == num[2] and num[1] != num[0]):
    paixing = '對子'
    a = base_count + sotr_dic[paixing]
    # print(paixing, a)
  else:
    a = base_count
  return a


# 對存儲玩傢分數的字典進行排序
def compare(count_dic):
  d = list(zip(count_dic.values(), count_dic.keys()))
  return sorted(d, reverse=True)


for key, value in player_dic.items():
  # print(key,value)
  num, huase = paixing(value)
  # print(num,huase)
  num = sotr(num)
  # print(num, huase)
  count1 = count(num, huase)
  # print(count1)
  count_dic[key] = count1
  print(key + "的牌為：" + str(value))
  count_new_list = compare(count_dic)
# print(count_new_list)
print('最終排名：' + "\t" + count_new_list[0][1] + "第一名" + "\t" + count_new_list[1][1] + "第二名" + "\t" + count_new_list[2][
  1] + "第三名" + "\t" + count_new_list[3][1] + "第四名" + "\t" + count_new_list[4][1] + "第五名")

到此這篇關於python編寫紮金花小程序的文章就介紹到這瞭,更多相關pytho紮金花小程序內容請搜索WalkonNet以前的文章或繼續瀏覽下面的相關文章希望大傢以後多多支持WalkonNet！

推薦閱讀：