**THIS IS THE CODE STARTED** #!/usr/bin/env python import sys class State: def c
ID: 3747474 • Letter: #
Question
**THIS IS THE CODE STARTED**
#!/usr/bin/env python
import sys
class State:
def children(self):
'''Returns an iterator over child states.
NOTE: Valid only if NOT is_terminal().
'''
raise NotImplementedError()
def payoff(self):
'''Returns the payoff of the state.
NOTE: Valid only if is_terminal().
'''
raise NotImplementedError()
def payoff_lower(self):
'''Returns a lower bound on the payoff.'''
raise NotImplementedError()
def payoff_upper(self):
'''Returns an upper bound on the payoff.'''
raise NotImplementedError()
def is_terminal(self):
'''Checks if the state is terminal.'''
raise NotImplementedError()
def is_max_player(self):
'''Checks if the current state is a max player's turn.'''
raise NotImplementedError()
class TicTacToe(State):
def __init__(self, board, player, is_max_player, move=None):
self._board = board
self._player = player
self._is_max_player = is_max_player
self._move = move
def children(self):
player = 'X' if self._player == 'O' else 'O'
is_max_player = not self._is_max_player
for r in range(3):
for c in range(3):
if self._board[r][c] == '_':
board = [[x for x in row] for row in self._board]
board[r][c] = self._player
yield TicTacToe(board, player, is_max_player, (r, c))
def payoff(self):
winner = self._winner()
if winner is None:
return 0
# Either previous min-player won (-1) or previous max-player won (+1).
return -1 if self._is_max_player else 1
def payoff_lower(self):
return -1
def payoff_upper(self):
return 1
def is_terminal(self):
if self._winner() is not None:
return True
for r in range(3):
for c in range(3):
if self._board[r][c] == '_':
return False
return True
def is_max_player(self):
return self._is_max_player
def move(self):
'''Returns the move used to transition to this state.'''
return self._move
def _winner(self):
'''Returns the current winner, if one exists.'''
board = self._board
for i in range(3):
# Check rows...
if board[i][0] != '_' and
board[i][0] == board[i][1] == board[i][2]:
return board[i][0]
# Check columns...
if board[0][i] != '_' and
board[0][i] == board[1][i] == board[2][i]:
return board[0][i]
# Check diagonals...
if board[0][0] != '_' and
board[0][0] == board[1][1] == board[2][2]:
return board[0][0]
if board[2][0] != '_' and
board[2][0] == board[1][1] == board[0][2]:
return board[2][0]
return None
def alpha_beta_minimax(state):
#write your code here
return state
def main():
player = raw_input()
board = [list(raw_input()) for _ in range(3)]
state = TicTacToe(board, player, True)
state = alpha_beta_minimax(state)
print('%d %d' % state.move())
if __name__ == '__main__':
main()
**SAMPLE OUTPUT**
Sample input 1:
X
___
__O
__X
Expected output
2 0
Sample Input 2:
X
___
__O
XOX
Expected output
0 0
Sample Input 3:
X
___
___
_XO
Expected output
1 0
7. Programming assignment. Tic-tac-toe Tic-tac-toe is a pencil-and-paper game for two players, X (ascii value 88) and O (ascii value 79), who take turns marking the spaces in a 3x3 grid. The player who succeeds in placing three respective marks in a horizontal, vertical, or diagonal row wins the game. Empty space is represented by_(ascii value 95), and the X player goes first. Here is an example game won by the first player, X: #¥ The function aloba.betaminima) takes in a state of the board. You should complete this function to print 2 space separated integers rand c which denote the row and column that will be marked in your next move. The top left position is denoted by (0,0) Note: the state is a class that has the board (2d array which captures values in 3X3 grid), current player, whether its max-player or not, next move. Please implement the included as a file with this assignment. using the included helper functions in alpha_beta.py How does it work? Your code is run alternately with the opponent bot for every move. Example input: Example output: 1 0 Next move isExplanation / Answer
from __future__ import print_function
ch = []
for x in range (0, 9) :
ch.append(str(x + 1))
player_1_turn = True
winner = False
def display_Board() :
print( ' -----')
print( '|' + ch[0] + '|' + ch[1] + '|' + ch[2] + '|')
print( ' -----')
print( '|' + ch[3] + '|' + ch[4] + '|' + ch[5] + '|')
print( ' -----')
print( '|' + ch[6] + '|' + ch[7] + '|' + ch[8] + '|')
print( ' ----- ')
while not winner :
display_Board()
if player_1_turn :
print( "Player 1:")
else :
print( "Player 2:")
try:
choices = int(input(">> "))
except:
print("please enter a valid field")
continue
if ch[choices - 1] == 'X' or ch [choices-1] == 'O':
print("illegal move, plase try again")
continue
if player_1_turn :
ch[choices - 1] = 'X'
else :
ch[choices - 1] = 'O'
player_1_turn = not player_1_turn
for x in range (0, 3) :
y = x * 3
if (ch[y] == ch[(y + 1)] and ch[y] == ch[(y + 2)]) :
winner = True
display_Board()
if (ch[x] == ch[(x + 3)] and ch[x] == ch[(x + 6)]) :
winner = True
display_Board()
if((ch[0] == ch[4] and ch[0] == ch[8]) or
(ch[2] == ch[4] and ch[4] == ch[6])) :
winner = True
display_Board()
print ("Player " + str(int(player_1_turn + 1)) + " wins! ")
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.