<\/p>\n
<\/p>\n
<\/p>\n
\ucf54\uc778 \uac8c\uc784\u00a0<\/strong>— \ub9c8\uc9c0\ub9c9 \ucf54\uc778\uc744 \ube7c\ub294 \uc790\uac00 \uc9c0\ub294 \uac8c\uc784<\/p>\n <\/p>\n # This is a variant of the Game of Bones recipe given in the easyAI library<\/p>\n from easyAI import TwoPlayersGame, id_solve, Human_Player, AI_Player class LastCoinStanding(TwoPlayersGame): # Define the players. Necessary parameter. # Define who starts the game. Necessary parameter. # Overall number of coins in the pile # Define max number of coins per move # Define possible moves # Remove coins # Did the opponent take the last coin? # Stop the game when somebody wins # Compute score # Show number of coins remaining in the pile if __name__ == “__main__”:<\/p>\n # Define the transposition table # Define the method # Solve the game # Start the game <\/p>\n <\/p>\n Tic Tac Toe \uac8c\uc784\u00a0<\/strong>— \uc77c\uc885\uc758 \uc0bc\ubaa9 \uac8c\uc784<\/p>\n <\/p>\n # This is a variant of the Tic Tac Toe recipe given in the easyAI library<\/p>\n from easyAI import TwoPlayersGame, AI_Player, Negamax class GameController(TwoPlayersGame): # Define the players # Define who starts the game # Define the board # Define possible moves # Make a move # Does the opponent have three in a line? (space)(space)return any([all([(self.board[i-1] == self.nopponent) # Check if the game is over # Show current position # Compute the score if __name__ == “__main__”:<\/p>\n # Define the algorithm # Start the game <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n <\/p>\n","protected":false},"excerpt":{"rendered":" \ucf54\uc778 \uac8c\uc784\u00a0— \ub9c8\uc9c0\ub9c9 \ucf54\uc778\uc744 \ube7c\ub294 \uc790\uac00 \uc9c0\ub294 \uac8c\uc784 # This is a variant of the Game of Bones recipe given in(more…)<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[35,29],"tags":[9,3],"class_list":["post-318","post","type-post","status-publish","format-standard","hentry","category-lets-do-computer-science","category-lets-do-science","tag-lets-do-computer-science","tag-lets-do-science"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t
\nfrom easyAI.AI import TT<\/p>\n
\n(space)def __init__(self, players):<\/p>\n
\n(space)(space)self.players = players<\/p>\n
\n(space)(space)self.nplayer = 1<\/p>\n
\n(space)(space)self.num_coins = 25<\/p>\n
\n(space)(space)self.max_coins = 4<\/p>\n
\n(space)def possible_moves(self):
\n(space)(space)return [str(x) for x in range(1, self.max_coins + 1)]<\/p>\n
\n(space)def make_move(self, move):
\n(space)(space)self.num_coins -= int(move)<\/p>\n
\n(space)def win(self):
\n(space)(space)return self.num_coins <= 0<\/p>\n
\n(space)def is_over(self):
\n(space)(space)return self.win()<\/p>\n
\n(space)def scoring(self):
\n(space)(space)return 100 if self.win() else 0<\/p>\n
\n(space)def show(self):
\n(space)(space)print(self.num_coins, ‘coins left in the pile’)<\/p>\n
\n(space)tt = TT()<\/p>\n
\n(space)LastCoinStanding.ttentry = lambda self: self.num_coins<\/p>\n
\n(space)result, depth, move = id_solve(LastCoinStanding,
\n(space)(space)range(2, 20), win_score=100, tt=tt)
\n(space)print(result, depth, move)<\/p>\n
\n(space)game = LastCoinStanding([AI_Player(tt), Human_Player()])
\n(space)game.play()<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\nfrom easyAI.Player import Human_Player<\/p>\n
\n(space)def __init__(self, players):<\/p>\n
\n(space)(space)self.players = players<\/p>\n
\n(space)(space)self.nplayer = 1<\/p>\n
\n(space)(space)self.board = [0] * 9<\/p>\n
\n(space)def possible_moves(self):
\n(space)(space)return [a + 1 for a, b in enumerate(self.board) if b == 0]<\/p>\n
\n(space)def make_move(self, move):
\n(space)(space)self.board[int(move) – 1] = self.nplayer<\/p>\n
\n(space)def loss_condition(self):
\n(space)(space)possible_combinations = [[1,2,3], [4,5,6], [7,8,9],\u00a0[1,4,7], [2,5,8], [3,6,9], [1,5,9], [3,5,7]]<\/p>\n
\n(space)(space)(space)for i in combination]) for combination in possible_combinations])<\/p>\n
\n(space)def is_over(self):
\n(space)(space)return (self.possible_moves() == []) or self.loss_condition()<\/p>\n
\n(space)def show(self):
\n(space)(space)print(‘\\n’+’\\n’.join([‘ ‘.join([[‘.’, ‘O’, ‘X’][self.board[3*j + i]]
\n(space)(space)(space)for i in range(3)]) for j in range(3)]))<\/p>\n
\n(space)def scoring(self):
\n(space)(space)return -100 if self.loss_condition() else 0<\/p>\n
\n(space)algorithm = Negamax(7)<\/p>\n
\n(space)GameController([Human_Player(), AI_Player(algorithm)]).play()<\/p>\n