-
Notifications
You must be signed in to change notification settings - Fork 47
/
newjeans0015.py
254 lines (217 loc) · 7.73 KB
/
newjeans0015.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
from typing import List, Union
import numpy as np
from IPython.display import clear_output
import time
import os
import random
BLACK = -1 # 黒
WHITE = 1 # 白
EMPTY = 0 # 空
def init_board(N:int=8):
"""
ボードを初期化する
N: ボードの大きさ (N=8がデフォルト値)
"""
board = np.zeros((N, N), dtype=int)
C0 = N//2
C1 = C0-1
board[C1, C1], board[C0, C0] = WHITE, WHITE # White
board[C1, C0], board[C0, C1] = BLACK, BLACK # Black
return board
def count_board(board, piece=EMPTY):
return np.sum(board == piece)
# Emoji representations for the pieces
BG_EMPTY = "\x1b[42m"
BG_RESET = "\x1b[0m"
stone_codes = [
f'{BG_EMPTY}⚫️{BG_RESET}',
f'{BG_EMPTY}🟩{BG_RESET}',
f'{BG_EMPTY}⚪️{BG_RESET}',
]
# stone_codes = [
# f'黒',
# f'・',
# f'白',
# ]
def stone(piece):
return stone_codes[piece+1]
def display_clear():
os.system('clear')
clear_output(wait=True)
BLACK_NAME=''
WHITE_NAME=''
def display_board(board, clear=True, sleep=0, black=None, white=None):
"""
オセロ盤を表示する
"""
global BLACK_NAME, WHITE_NAME
if clear:
clear_output(wait=True)
if black:
BLACK_NAME=black
if white:
WHITE_NAME=white
for i, row in enumerate(board):
for piece in row:
print(stone(piece), end='')
if i == 1:
print(f' {BLACK_NAME}')
elif i == 2:
print(f' {stone(BLACK)}: {count_board(board, BLACK):2d}')
elif i == 3:
print(f' {WHITE_NAME}')
elif i == 4:
print(f' {stone(WHITE)}: {count_board(board, WHITE):2d}')
else:
print() # New line after each row
if sleep > 0:
time.sleep(sleep)
def all_positions(board):
N = len(board)
return [(r, c) for r in range(N) for c in range(N)]
# Directions to check (vertical, horizontal)
directions = [(0, 1), (1, 0), (0, -1), (-1, 0), (1, 1), (1, -1), (-1, -1), (-1, 1)]
def is_valid_move(board, row, col, player):
# Check if the position is within the board and empty
N = len(board)
if row < 0 or row >= N or col < 0 or col >= N or board[row, col] != 0:
return False
for dr, dc in directions:
r, c = row + dr, col + dc
if 0 <= r < N and 0 <= c < N and board[r, c] == -player:
while 0 <= r < N and 0 <= c < N and board[r, c] == -player:
r, c = r + dr, c + dc
if 0 <= r < N and 0 <= c < N and board[r, c] == player:
return True
return False
def get_valid_moves(board, player):
return [(r, c) for r, c in all_positions(board) if is_valid_move(board, r, c, player)]
def flip_stones(board, row, col, player):
N = len(board)
stones_to_flip = []
for dr, dc in directions:
directional_stones_to_flip = []
r, c = row + dr, col + dc
while 0 <= r < N and 0 <= c < N and board[r, c] == -player:
directional_stones_to_flip.append((r, c))
r, c = r + dr, c + dc
if 0 <= r < N and 0 <= c < N and board[r, c] == player:
stones_to_flip.extend(directional_stones_to_flip)
return stones_to_flip
def display_move(board, row, col, player):
stones_to_flip = flip_stones(board, row, col, player)
board[row, col] = player
display_board(board, sleep=0.3)
for r, c in stones_to_flip:
board[r, c] = player
display_board(board, sleep=0.1)
display_board(board, sleep=0.6)
def find_eagar_move(board, player):
valid_moves = get_valid_moves(board, player)
max_flips = 0
best_result = None
for r, c in valid_moves:
stones_to_flip = flip_stones(board, r, c, player)
if max_flips < len(stones_to_flip):
best_result = (r, c)
max_flips = len(stones_to_flip)
return best_result
class OthelloAI(object):
def __init__(self, face, name):
self.face = face
self.name = name
def __repr__(self):
return f"{self.face}{self.name}"
def move(self, board: np.array, piece: int)->tuple[int, int]:
valid_moves = get_valid_moves(board, piece)
return valid_moves[0]
def say(self, board: np.array, piece: int)->str:
if count_board(board, piece) >= count_board(board, -piece):
return 'やったー'
else:
return 'がーん'
class OchibiAI(OthelloAI):
def __init__(self, face, name):
self.face = face
self.name = name
def move(self, board: np.array, piece: int)->tuple[int, int]:
valid_moves = get_valid_moves(board, piece)
return valid_moves[0]
import traceback
def board_play(player: OthelloAI, board, piece: int):
display_board(board, sleep=0)
if len(get_valid_moves(board, piece)) == 0:
print(f"{player}は、置けるところがありません。スキップします。")
return True
try:
start_time = time.time()
r, c = player.move(board.copy(), piece)
end_time = time.time()
except:
print(f"{player.face}{player.name}は、エラーを発生させました。反則まけ")
traceback.print_exc()
return False
if not is_valid_move(board, r, c, piece):
print(f"{player}が返した({r},{c})には、置けません。反則負け。")
return False
display_move(board, r, c, piece)
return True
def comment(player1: OthelloAI, player2: OthelloAI, board):
try:
print(f"{player1}: {player1.say(board, BLACK)}")
except:
pass
try:
print(f"{player2}: {player2.say(board, WHITE)}")
except:
pass
def game(player1: OthelloAI, player2: OthelloAI,N=6):
board = init_board(N)
display_board(board, black=f'{player1}', white=f'{player2}')
while count_board(board, EMPTY) > 0:
if not board_play(player1, board, BLACK):
break
if not board_play(player2, board, WHITE):
break
comment(player1, player2, board)
#自分のAI
class ringoAI(OthelloAI):
def __init__(self, face, name):
self.face = '🐰'
self.name = 'おぱんちゅう'
def move(self, board: np.array, piece: int) -> tuple[int, int]:
valid_moves = get_valid_moves(board, piece)
# 勝利手のチェック
for move in valid_moves:
if self.is_winning_move(board, move, piece):
return move
# ブロッキング手のチェック
for move in valid_moves:
if self.is_blocking_move(board, move, piece):
return move
# 戦略手がない場合はランダムな手を選択
return random.choice(valid_moves)
def is_winning_move(self, board: np.array, move: tuple[int, int], piece: int) -> bool:
"""
プレイヤーにとっての勝利手かどうかをチェックします。
"""
board_copy = board.copy()
row, col = move
stones_to_flip = flip_stones(board_copy, row, col, piece)
board_copy[row, col] = piece
for r, c in stones_to_flip:
board_copy[r, c] = piece
return count_board(board_copy, piece) > count_board(board, piece)
def is_blocking_move(self, board: np.array, move: tuple[int, int], piece: int) -> bool:
"""
対戦相手が勝利するのをブロックする手かどうかをチェックします。
"""
opponent_piece = -piece
board_copy = board.copy()
row, col = move
stones_to_flip = flip_stones(board_copy, row, col, piece)
board_copy[row, col] = piece
for r, c in stones_to_flip:
board_copy[r, c] = piece
opponent_moves = get_valid_moves(board_copy, opponent_piece)
return any(self.is_winning_move(board_copy, opp_move, opponent_piece) for opp_move in opponent_moves)