search - Simplify MiniMax algorithm for Tic Tac Toe -


i have tic tac toe game works perfectly, there way alter minimax algorithm have. it's simpler in way or shorted.

def maximized_move(self,gameinstance):     ''' find maximized move'''         bestscore = none     bestmove = none     m in gameinstance.get_free_positions():         gameinstance.mark(self.marker,m)          if gameinstance.is_gameover():             score = self.get_score(gameinstance)         else:             move_position,score = self.minimized_move(gameinstance)          gameinstance.revert_last_move()          if bestscore == none or score > bestscore:             bestscore = score             bestmove = m     return bestmove, bestscore def minimized_move(self,gameinstance):     ''' find minimized move'''     bestscore = none     bestmove = none     m in gameinstance.get_free_positions():         gameinstance.mark(self.opponentmarker,m)          if gameinstance.is_gameover():             score = self.get_score(gameinstance)         else:             move_position,score = self.maximized_move(gameinstance)          gameinstance.revert_last_move()          if bestscore == none or score < bestscore:             bestscore = score             bestmove = m     return bestmove, bestscore 

if looking optimize / speed min max take @ alpha beta pruning - same algo optimal shortcuts


Comments

Popular posts from this blog

javascript - jquery or ashx not working -

opencv - DataType<cv::detail::deriv_type>::depth what is it used for -

python 3.x - Mapping specific letters onto a list of words -