entityMap|blocks|key|5tkfq|text|你可以用字典吗？如下所示：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|c09e5|#dict+of+winning+outcomes,+the+first+layer+represents+the+AI+moves,+and+the+inner+
#layer+represent+the+player+move+and+the+outcome
ai+=+{
++++'punch'+:+{
++++++++'punch'+:+'tie',
++++++++'kick'+:+'wins',
++++},
++++'stab'+:+{
++++++++'punch'+:+'loses',
++++++++'kick'+:+'loses'
++++}
}

ai_move+=+'punch'
player_move+=+'kick'
print+ai[ai_move][player_move]+#output:+wins


ai_move+=+'stab'
player_move+=+'punch'
print+ai[ai_move][player_move]+#output:+loses|code-block|syntax|javascript|ce950|我没有计划好所有的动作，但你明白大意了|3vj1i^0|0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|K|9|@]|A|@]|B|$]]|$2|C|4|D|6|E|8|L|9|@]|A|@]|B|$F|G]]|$2|H|4|I|6|7|8|M|9|@]|A|@]|B|$]]|$2|J|4|-4|6|7|8|N|9|@]|A|@]|B|$]]]]

You could use a dict? Something like this: 

<pre><code>#dict of winning outcomes, the first layer represents the AI moves, and the inner 
#layer represent the player move and the outcome
ai = {
 'punch' : {
 'punch' : 'tie',
 'kick' : 'wins',
 },
 'stab' : {
 'punch' : 'loses',
 'kick' : 'loses'
 }
}

ai_move = 'punch'
player_move = 'kick'
print ai[ai_move][player_move] #output: wins


ai_move = 'stab'
player_move = 'punch'
print ai[ai_move][player_move] #output: loses
</code></pre>

I didn't map out all the moves, but you get the gist

entityMap|blocks|key|ahnha|text|是的，将决策作为键/值对存储在字典中，将所有可能的组合作为键，将决策作为结果。基本上，为可能的移动创建一个查找表。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|53uop|这加快了决策速度，但代价是必须存储所有可能的组合。|7134h|def+tie():
++++print("It's+a+tie!")

def+lose():
++++print("You+lose")

def+win():
++++print("You+win")
moves+=+{+
+++++#+player_ai+action
++++'punch_punch':+tie,
++++'punch_kick':+lose,
++++'punch_stab':+lose,
++++<..>
}
player_move+=+<move>
ai_move+=+<move>
key+=+"_".join([player_move,+ai_move])
if+key+in+moves:
++++#+Execute+appropriate+function
++++return+moves[key]()
raise+Exception("Invalid+move")|code-block|syntax|javascript|7j0ud^0|0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|K|9|@]|A|@]|B|$]]|$2|C|4|D|6|7|8|L|9|@]|A|@]|B|$]]|$2|E|4|F|6|G|8|M|9|@]|A|@]|B|$H|I]]|$2|J|4|-4|6|7|8|N|9|@]|A|@]|B|$]]]]

Yes, store the decisions as key/value pairs in a dictionary with all the possible combinations as the key and decision as result. Basically make a lookup table for the possible moves. 

This speeds up decision making at the expense of having to store all possible combinations.

<pre><code>def tie():
 print("It's a tie!")

def lose():
 print("You lose")

def win():
 print("You win")
moves = { 
 # player_ai action
 'punch_punch': tie,
 'punch_kick': lose,
 'punch_stab': lose,
 &lt;..&gt;
}
player_move = &lt;move&gt;
ai_move = &lt;move&gt;
key = "_".join([player_move, ai_move])
if key in moves:
 # Execute appropriate function
 return moves[key]()
raise Exception("Invalid move")
</code></pre>

entityMap|blocks|key|98im8|text|你可以试试字典(嵌套字典)。保留文本形式的值和键，而不是映射到数字，以提高可读性。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|65u1l|outcome+=+{}
outcome['punch']+=+{}
outcome['punch']['punch']+=+'Tie'
outcome['punch']['kick']+=+'Lose'
...
outcome['kick']+=+{}
outcome['kick']['punch']+=+'Win'
outcome['kick']['kick']+=+'Tie'
...
i_do+=+'punch'
he_does+=+'fling'
...
if+outcome[i_do][he_does]+==+'Win':
++++print("Woohoo!")|code-block|syntax|javascript|cdfnd^0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|I|9|@]|A|@]|B|$]]|$2|C|4|D|6|E|8|J|9|@]|A|@]|B|$F|G]]|$2|H|4|-4|6|7|8|K|9|@]|A|@]|B|$]]]]

You could try a dictionary of dictionaries (nested dictionary). Keep values and keys in text form, rather than map to numbers, to improve readability.

<pre><code>outcome = {}
outcome['punch'] = {}
outcome['punch']['punch'] = 'Tie'
outcome['punch']['kick'] = 'Lose'
...
outcome['kick'] = {}
outcome['kick']['punch'] = 'Win'
outcome['kick']['kick'] = 'Tie'
...
i_do = 'punch'
he_does = 'fling'
...
if outcome[i_do][he_does] == 'Win':
 print("Woohoo!")
</code></pre>

entityMap|blocks|key|6hjnb|text|您可以使用python字典将移动映射到数字：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|fvdi7|move+=+{'Punch':+0,+'Kick':+1}|code-block|syntax|javascript|3bo9u|然后使用矩阵来确定结果。Numpy可以用来做这件事|2a9d4|import+numpy
move+=+{'Punch':+0,+'Kick':+1}

outcome+=+numpy.matrix([['Tie','Loses'],['Wins','Tie']])


#+Punch+vs+Punch+=>+Tie
print+outcome[move['Punch'],+move['Punch']]

#+Punch+vs+Kick+=>+Punch+loses
print+outcome[move['Punch'],+move['Kick']]|306hq^0|0|0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|M|9|@]|A|@]|B|$]]|$2|C|4|D|6|E|8|N|9|@]|A|@]|B|$F|G]]|$2|H|4|I|6|7|8|O|9|@]|A|@]|B|$]]|$2|J|4|K|6|E|8|P|9|@]|A|@]|B|$F|G]]|$2|L|4|-4|6|7|8|Q|9|@]|A|@]|B|$]]]]

You could use a python dictionary to map moves to numbers:

<pre><code>move = {'Punch': 0, 'Kick': 1}
</code></pre>

And then use a matrix to determine the outcome. Numpy can be used for that

<pre><code>import numpy
move = {'Punch': 0, 'Kick': 1}

outcome = numpy.matrix([['Tie','Loses'],['Wins','Tie']])


# Punch vs Punch =&gt; Tie
print outcome[move['Punch'], move['Punch']]

# Punch vs Kick =&gt; Punch loses
print outcome[move['Punch'], move['Kick']]
</code></pre>

entityMap|blocks|key|406sm|text|您可以创建与上表类似的攻击地图，如下所示|type|unstyled|depth|inlineStyleRanges|entityRanges|data|494su|map+=+[
++++[0,-1,-1,1,1,-1],
++++[1,0,-1,-1,1,-1],
++++[1,1,0,-1,-1,1],
++++[-1,1,1,0,-1,1],
++++[-1,-1,1,1,0,-1],
++++[1,1,-1,-1,1,0]
]|code-block|syntax|javascript|30d0m|这里，0是平局，1是胜利，-1是失败。|egarb|现在创建一个攻击数组，其中攻击的地点与上面的地图相对应。|3lt87|attacks+=+["Punch",+"Kick",+"Stab",+"Throw",+"Fling",+"Uppercut"]|aoeg5|现在，您可以很容易地发现一次攻击是否击败了另一次攻击|bfoec|map[attacks.index("Stab")][attacks.index("Punch")]

>>>+1|cgt0j|Stab胜过wins|8ap8j^0|0|0|0|0|0|0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|U|9|@]|A|@]|B|$]]|$2|C|4|D|6|E|8|V|9|@]|A|@]|B|$F|G]]|$2|H|4|I|6|7|8|W|9|@]|A|@]|B|$]]|$2|J|4|K|6|7|8|X|9|@]|A|@]|B|$]]|$2|L|4|M|6|E|8|Y|9|@]|A|@]|B|$F|G]]|$2|N|4|O|6|7|8|Z|9|@]|A|@]|B|$]]|$2|P|4|Q|6|E|8|10|9|@]|A|@]|B|$F|G]]|$2|R|4|S|6|7|8|11|9|@]|A|@]|B|$]]|$2|T|4|-4|6|7|8|12|9|@]|A|@]|B|$]]]]

I'd use a 2-dimensional list for this. Each attack is decoded to an index 0 to 5 and win tie and loss are decoded as 1, 0 and -1.

So the list will look something like this (not based on your example, I just put some random numbers):

<pre><code>table = [[1,0,-1,0,1,-1],[1,1,0,1,0,-1],...,etc.]
</code></pre>

And you will retrieve it like this:

<pre><code>table[0][1]
</code></pre>

entityMap|blocks|key|1q3t7|text|我会用一个二维列表来做这件事。每一次攻击都被解码为0到5的索引，并将平局和失利解码为1，0和-1。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2hm01|所以这个列表看起来像这样(不是基于你的例子，我只是放了一些随机数)：|bjmg9|table+=+[[1,0,-1,0,1,-1],[1,1,0,1,0,-1],...,etc.]|code-block|syntax|javascript|1lf1h|您将像这样检索它：|a5rib|table[0][1]|6svnf^0|0|0|0|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|O|9|@]|A|@]|B|$]]|$2|C|4|D|6|7|8|P|9|@]|A|@]|B|$]]|$2|E|4|F|6|G|8|Q|9|@]|A|@]|B|$H|I]]|$2|J|4|K|6|7|8|R|9|@]|A|@]|B|$]]|$2|L|4|M|6|G|8|S|9|@]|A|@]|B|$H|I]]|$2|N|4|-4|6|7|8|T|9|@]|A|@]|B|$]]]]

I have a table of moves that decide whether or not the player wins based on their selection against the AI. Think Rock, Paper, Scissors with a lot more moves.
I'll be eventually coding it in Python, but before I begin, I want to know if there is a better way of doing this rather than LOTS and LOTS of IF statements?

The table looks like this:

<a href="https://i.stack.imgur.com/iVldr.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/iVldr.png" alt="enter image description here"></a>

I'm thinking that the moves will need to be assigned numbers, or something like that? I don't know where to start...

Better alternative to lots of IF statements? Table of values

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

 我有一个移动表格，根据玩家对AI的选择来决定玩家是否获胜。想想石头，布，剪刀，还有更多的动作。我最终会用Python编写代码，但在开始之前，我想知道是否有更好的方法来完成这项工作，而不是使用大量的if语句？ 该表如下所示： ​ ? ​ 我在想，这些动作需要分配数字，或者类似的东西？我不知道从哪里开始..。 

问比很多IF语句更好的选择？值表
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问比很多IF语句更好的选择？值表EN