我目前正在用 Python 编写一个骰子扑克游戏。这些规则与《巫师 2》中的游戏不同，而是基于不久前从 App Store 下架的旧移动骰子扑克游戏。
规则如下：
- 玩家和 AI 最初各掷 5 个扑克骰子。
- 玩家和 AI 选择要握住的骰子并掷出其余的骰子，将结果相互显示。
- 重复上述步骤。
谁的手牌排名更高（见下文）谁获胜，绝对高的牌作为决胜局。
- 五种
- 同一样四个
- 直的
- 客满
- 三样
- 两对
- 一对
- 高卡
相关代码如下：
class Tree(object):
'''Generic tree node'''
def __init__(self, children=None, value=None, type=None):
self.children = []
self.value = value
self.type = type # either 'player', 'ai', or 'chance'
if children is not None:
for child in children:
self.add_child(child)
def add_child(self, node):
assert isinstance(node, Tree)
self.children.append(node)
def is_terminal(self):
return len(self.children) == 0
def expectiminimax(node):
'''Adapted from Wikipedia's pseudocode'''
MAX_INT = 1e20
if node.is_terminal():
return node.value
if node.type == 'player':
q = MAX_INT
for child in node.children:
q = min(q, expectiminimax(child))
elif node.type == 'ai':
q = -MAX_INT
for child in node.children:
q = max(q, expectiminimax(child))
elif node.type == 'chance':
q = 0
for child in node.children:
# All children are equally probable
q += len(node.children)**-1 * expectiminimax(child)
return q
def ai_choose(ai_hand, player_hand):
'''
Given an AI hand and a player hand, choose which cards to hold onto
for best outcome.
'''
def construct_tree(ai_hand, player_hand):
'''
Construct a 5-layer (?) tree for use with expectiminimax.
Δ MAX
/ \
O ... O CHANCE - Possible AI moves
/ \ / \
∇ .. ∇ ∇ .. ∇ MIN - Possible card dice rolls
/ \ ........
O ... O ........... CHANCE - Possible player moves
/ \ / \ ............
▢ .. ▢ ▢ .. ▢ ............. END - Possible card dice rolls
'''
tree_structure = ['ai', 'chance', 'player', 'chance', 'ai']
tree = Tree(type=tree_structure[0])
for subset in powerset(ai_hand.hand):
tree.add_child(Tree(value=subset))
# ...
这个层结构正确吗？或者是否应该重新排列最小、最大和机会层？
也欢迎其他一般性意见。