擅长:python、mysql、java
<p>下面是1000000卷的numpy实现的开始。在</p>
<p>我已经标记了这个社区wiki如果有人想扩展它,请编辑。在</p>
<p>3个攻击骰子,2个防御骰子</p>
<pre><code>import numpy
A = numpy.random.randint(1,6,size=(1000000,3)).sort()
D = numpy.random.randint(1,6,size=(1000000,2)).sort()
Ahigh = A[:,2]
Dhigh = D[:,2]
Awins1st = (Ahigh > Dhigh)
A2nd = A[:,1]
D2nd = D[:,1]
Awins2nd = (A2nd > D2nd)
# needed: tabulate results, remove smelly repeating code, generalize
</code></pre>
<p><code>Awins1st</code>和<code>Awins2nd</code>是1000000个元素的真/假数组,表示攻击者通过比较3个A骰子和2个D骰子赢得了第一次还是第二次“战斗”。在</p>