PriitJ – 15. oktoober 2017, kell 07:56

2017-10-15T07:56:33Z

←Vanem redaktsioon		Redaktsioon: 15. oktoober 2017, kell 09:56
1. rida:		1. rida:
	<pre>		<pre>



	X=1		X=1
	O=-1		O=-1
53. rida:		50. rida:


	algus = [~~None~~, ~~None~~, ~~None~~,		algus = [ X, O, X,
	~~None~~, None, ~~None~~,		O, None, O,
	None, None, None,		None, None, None,
	X]		X]
60. rida:		57. rida:

	#print(minimax_decision(algus))		#print(minimax_decision(algus))



	</pre>		</pre>

PriitJ: Uus lehekülg: '

    X=1 O=-1   def actions(state):     for i in range(9):         if state[i] is None:             yield i  def result(a, state):     newstate = state.copy()     tomove = st...'

2016-11-14T10:50:26Z

Uus lehekülg: '<pre> X=1 O=-1 def actions(state): for i in range(9): if state[i] is None: yield i def result(a, state): newstate = state.copy() tomove = st...'

Uus lehekülg

<pre>

X=1
O=-1

def actions(state):
for i in range(9):
if state[i] is None:
yield i

def result(a, state):
newstate = state.copy()
tomove = state[9]
newstate[a] = tomove
newstate[9] = -tomove
return newstate

def successors(state):
for a in actions(state):
s = result(a, state)
yield (a, s)

def terminal_test(state):
acts = list(actions(state))
if not acts:
return True
value = utility(state)
if value != 0:
return True
return False

def utility(state):
triples = [(0, 1, 2),
(3, 4, 5),
(6, 7, 8),
(0, 3, 6),
(1, 4, 7),
(2, 5, 8),
(0, 4, 8),
(6, 4, 2)]
for a, b, c in triples:
if state[a] is None: continue
if (state[a] == state[b] and
state[b] == state[c]):
if state[a] == MYSIDE:
return 1
else:
return -1
return 0

algus = [None, None, None,
None, None, None,
None, None, None,
X]
MYSIDE = X

#print(minimax_decision(algus))

</pre>

IFI6057minimax - Redigeerimiste ajalugu

PriitJ – 15. oktoober 2017, kell 07:56

PriitJ: Uus lehekülg: '
X=1 O=-1 def actions(state): for i in range(9): if state[i] is None: yield i def result(a, state): newstate = state.copy() tomove = st...'