人工智能实验代码整理
人工智能实验代码整理
文章目录
- 人工智能实验代码整理
-
- 状态空间表示——猴子摘香蕉
- 极大极小剪枝——五子棋
状态空间表示——猴子摘香蕉
# -*- coding: utf-8 -*-
# State类，记录当前状态
class State:
def __init__(self, monkey=-1, box=0,banana=1, monbox=-1):
self.monkey = monkey # -1:Monkey at A 0: Monkey at B 1:Monkey at C
self.box = box # -1:box at A 0:box at B 1:box at C
self.banana = banana # Banana at C,Banana=1
self.monbox = monbox # -1: monkey not on the box 1: monkey on the box
# 复制前一个状态情况给当前状态，注意不是将对象直接复制，而是创建新的对象复制原状态的数据
def copyState(state_i):
state_iplus1 = State()
state_iplus1.monkey = state_i.monkey
state_iplus1.box = state_i.box
state_iplus1.banana = state_i.banana
state_iplus1.monbox = state_i.monbox
return state_iplus1
# function monkeygoto,it makes the monkey goto the other place
def monkeygoto(b,i):
a=b
if (a==-1):
States[i+1]=copyState(States[i])
States[i+1].monkey=-1
routesave.insert(i,"Monkey go to A")
elif(a==0):
States[i+1]=copyState(States[i])
States[i+1].monkey=0
routesave.insert(i,"Monkey go to B")
elif(a==1):
States[i+1]=copyState(States[i])
States[i+1].monkey=1
routesave.insert(i,"Monkey go to C")
else:
print("parameter is wrong")
# function movebox,the monkey move the box to the other place
def movebox(a,i):
B = a
if(B==-1):
routesave.insert(i,"Monkey move box to A")
States[i+1]=copyState(States[i])
States[i+1].monkey=-1
States[i+1].box=-1
elif(B==0):
routesave.insert(i,"Monkey move box to B")
States[i+1]=copyState(States[i])
States[i+1].monkey=0
States[i+1].box=0
elif(B==1):
routesave.insert(i,"Monkey move box to C")
States[i+1]=copyState(States[i])
States[i+1].monkey=1
States[i+1].box=1
else:
print("parameter is wrong")
# function climbonto,the monkey climb onto the box
def climbonto(i):
routesave.insert(i, "Monkey climb onto the box")
States[i+1]=copyState(States[i])
States[i+1].monbox=-1
# function climbdown,monkey climb down from the box
def climbdown(i):
routesave.insert(i, "Monkey climb down from the box")
States[i+1]=copyState(States[i])
States[i+1].monbox=-1
# function reach,if the monkey,box,and banana are at the same place,the monkey reach banana
def reach(i):
routesave.insert(i,"Monkey reach the banana")
# output the solution to the problem
def showSolution(i):
print ("Result to problem:")
for c in range(i+1):
print("Step %d : %s \n"%(c+1,routesave[c]))
# perform next step
def nextStep(i):
#print("nextstep"+str(i))
#print States[i].box
j=0
if(i>=150):
print("%s \n", "steplength reached 150,have problem ")
if(States[i].monbox == 1 and States[i].monkey == States[0].banana and States[i].banana == States[0].banana and States[i].box == States[0].banana):
print("sss")
showSolution(i)
return
for c in range(i):
if(States[c].monkey==States[i].monkey and States[c].box==States[i].box and States[c].banana==States[i].banana and States[c].monbox==States[i].monbox ):
showSolution(i)
return
j=i+1
if (States[i].box == States[i].monkey and States[i].box == States[i].banana):
#print("1")
if(States[i].monbox==-1):
climbonto(i)
reach(i + 1)
nextStep(j)
else:
reach(i + 1)
nextStep(j)
if (States[i].box == States[i].monkey and States[i].box != States[i].banana):
#print("2")
if (States[i].monbox == -1):
movebox(States[i].banana, i)
nextStep(j)
else:
climbdown(i)
nextStep(j)
if (States[i].box != States[i].monkey and States[i].box == States[i].banana):
#print("3")
monkeygoto(States[i].box, i)
nextStep(j)
if (States[i].box != States[i].monkey and States[i].box != States[i].banana):
#print("4")
monkeygoto(States[i].box, i)
nextStep(j)
# 如果满足条件，就输出结果
if __name__ == "__main__":
s = input("please input state: monkey, box, banana, ifMonkeyIsOnBox: \n")
states = s.split(" ")
state = State(int(states[0]), int(states[1]), int(states[2]), int(states[3]))
States = [None]*150
routesave = [None]*150
States.insert(0,state)
nextStep(0)
极大极小剪枝——五子棋
import pygame
import os
import time
import sys
# 参数设置
WIDTH = 720 # 屏幕宽度
HEIGHT = 720 # 屏幕高度
SIZE = 19 # 棋盘大小为19*19
GRID_WIDTH = WIDTH // (SIZE+1) # 网格尺寸
FPS = 30 # 刷新频率
# 颜色设置
WHITE = (255, 255, 255)
BLACK = (0, 0, 0)
RED = (255, 0, 0)
BLUE = (0, 0, 255)
alpha_beta_flag = int(input("Do you need Alpha-Beta cutting strategy?(1/0:yes/no)"))
color_choice = int(input("Do you want to choose black or white?(1/0:black/white)"))
# pygame初始化设定
pygame.init()
screen = pygame.display.set_mode((WIDTH, HEIGHT))
pygame.display.set_caption("五子棋AI")
clock = pygame.time.Clock()
# base_folder = os.path.dirname(__file__)
# img_folder = os.path.join(base_folder, "images")
img_folder = "images"
bg_img = pygame.image.load(os.path.join(img_folder, "background.png"))
background = pygame.transform.scale(bg_img, (WIDTH, HEIGHT))
back_rect = background.get_rect()
# 绘制网格线
def draw_background(surf):
screen.blit(background, back_rect)
rect_lines = [((GRID_WIDTH, GRID_WIDTH), (GRID_WIDTH, HEIGHT - GRID_WIDTH)),
((GRID_WIDTH, GRID_WIDTH), (WIDTH - GRID_WIDTH, GRID_WIDTH)),
((GRID_WIDTH, HEIGHT - GRID_WIDTH), (WIDTH - GRID_WIDTH, HEIGHT - GRID_WIDTH)),
((WIDTH - GRID_WIDTH, GRID_WIDTH), (WIDTH - GRID_WIDTH, HEIGHT - GRID_WIDTH))]
for line in rect_lines:
pygame.draw.line(surf, BLACK, line[0], line[1], 2)
for i in range(17):
pygame.draw.line(surf, BLACK, (GRID_WIDTH * (2 + i), GRID_WIDTH),
(GRID_WIDTH * (2 + i), HEIGHT - GRID_WIDTH))
pygame.draw.line(surf, BLACK,
(GRID_WIDTH, GRID_WIDTH * (2 + i)),
(HEIGHT - GRID_WIDTH, GRID_WIDTH * (2 + i)))
circle_center = [(GRID_WIDTH * 4, GRID_WIDTH * 4),
(GRID_WIDTH * 10, GRID_WIDTH * 4),
(GRID_WIDTH * 16, GRID_WIDTH * 4),
(GRID_WIDTH * 4, GRID_WIDTH * 10),
(GRID_WIDTH * 10, GRID_WIDTH * 10),
(GRID_WIDTH * 16, GRID_WIDTH * 10),
(GRID_WIDTH * 4, GRID_WIDTH * 16),
(GRID_WIDTH * 10, GRID_WIDTH * 16),
(GRID_WIDTH * 16, GRID_WIDTH * 16)]
for circle in circle_center:
pygame.draw.circle(surf, BLACK, circle, 5)
win_flag = 0 # -1:white win;1:black win
color_flag = 1 # black
step = 0
matrix = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)] # 棋型矩阵
min_x, min_y, max_x, max_y = 0, 0, 0, 0 # 搜索范围
# 刷新棋盘已占有棋子的外切矩形范围
def xy_range(x, y):
global min_x, min_y, max_x, max_y
if step == 0:
min_x, min_y, max_x, max_y = x, y, x, y
else:
if x < min_x:
min_x = x
elif x > max_x:
max_x = x
if y < min_y:
min_y = y
elif y > max_y:
max_y = y
# 棋型评估分值
shape_score = {
(0, 1, 0): 5, # 单子
(0, 1, 1, -1): 10, # 死2
(-1, 1, 1, 0): 10, # 死2
(0, 1, 1, 0): 20, # 活2
(-1, 1, 1, 1, 0): 20, # 死3
(0, 1, 1, 1, -1): 20, # 死3
(0, 1, 1, 1, 0): 45, # 活3
(-1, 1, 1, 1, 1, 0): 60, # 死4
(0, 1, 1, 1, 1, -1): 60, # 死4
(0, 1, 1, 1, 1, 0): 120, # 活4
(0, 1, 1, 1, 1, 1, 0): 300, # 成5
(0, 1, 1, 1, 1, 1, -1): 300,
(-1, 1, 1, 1, 1, 1, 0): 300,
(-1, 1, 1, 1, 1, 1, -1): 300,
(-1, 1, 1, 1, 1, 1, 1, -1): 300,
(-1, 1, 1, 1, 1, 1, 1, 1, -1): 300
}
# 评估一个节点分值
def evaluate_node(list_h, list_v, list_s, list_b):
score_h = shape_score.get(tuple(list_h), 0)
score_v = shape_score.get(tuple(list_v), 0)
score_s = shape_score.get(tuple(list_s), 0)
score_b = shape_score.get(tuple(list_b), 0)
rank = [score_h, score_v, score_s, score_b]
rank.sort()
rank.reverse()
score = rank[0] + rank[1] # 把最大的两个分值相加作为总分值
return score
# 获得该结点在水平、竖直、左斜、反斜方向的一维向量
def get_list(mx, my, color):
global matrix
list1 = []
tx, ty = mx, my
while matrix[tx][ty] == color:
list1.append(1) # 1表示是己方棋子，-1是敌方棋子
tx = tx + 1
ty = ty
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list1.append(-1)
else:
list1.append(0)
list1.pop(0) # 删除自己 防止在合并的时候重复计算
list2 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list2.append(1)
tx = tx - 1
ty = ty
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list2.append(-1)
else:
list2.append(0)
list2.reverse()
list_h = list2 + list1
list1 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list1.append(1)
tx = tx
ty = ty + 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list1.append(-1)
else:
list1.append(0)
list1.pop(0)
list2 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list2.append(1)
tx = tx
ty = ty - 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list2.append(-1)
else:
list2.append(0)
list2.reverse()
list_v = list2 + list1
list1 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list1.append(1)
tx = tx + 1
ty = ty + 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list1.append(-1)
else:
list1.append(0)
list1.pop(0)
list2 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list2.append(1)
tx = tx - 1
ty = ty - 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list2.append(-1)
else:
list2.append(0)
list2.reverse()
list_s = list2 + list1
list1 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list1.append(1)
tx = tx + 1
ty = ty - 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list1.append(-1)
else:
list1.append(0)
list1.pop(0)
list2 = []
tx = mx
ty = my
while matrix[tx][ty] == color:
list2.append(1)
tx = tx - 1
ty = ty + 1
if matrix[tx][ty] == -color or tx == 0 or ty == 0 or tx > SIZE or ty > SIZE:
list2.append(-1)
else:
list2.append(0)
list2.reverse()
list_b = list2 + list1
return [list_h, list_v, list_s, list_b]
# 判断搜索范围是否超出边界，返回合法的搜索范围
def is_out(_min_x, _min_y, _max_x, _max_y):
delta = 1
if _min_x - delta < 1:
min_tx = 1
else:
min_tx = _min_x - delta
if _min_y - delta < 1:
min_ty = 1
else:
min_ty = _min_y - delta
if _max_x + delta > SIZE:
max_tx = SIZE
else:
max_tx = _max_x + delta
if _max_y + delta > SIZE:
max_ty = SIZE
else:
max_ty = _max_y + delta
return [min_tx, min_ty, max_tx, max_ty]
# 根据当前棋面向前搜索2步，利用极大极小算法及alpha-beta剪枝
def ai_go():
global min_x, max_x, min_y, max_y, color_flag, matrix
time_start = time.time()
evaluate_matrix = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)] # 结点估值矩阵
if step == 0:
if color_choice == 0: #用户选择白棋
add_chess((SIZE + 1) // 2, (SIZE + 1) // 2, color_flag)
else:
if step == 1 and color_choice == 1:
if matrix[(SIZE + 1) // 2][(SIZE + 1) // 2] == 0:
rx, ry = (SIZE + 1) // 2,(SIZE + 1) // 2
else:
if matrix[(SIZE + 1) // 2][(SIZE + 1) // 2] != 0 and matrix[(SIZE + 1) // 2 + 1][(SIZE + 1) // 2 + 1] == 0:
rx, ry = (SIZE + 1) // 2 + 1,(SIZE + 1) // 2 + 1
else:
min_tx1, min_ty1, max_tx1, max_ty1 = is_out(min_x, min_y, max_x, max_y)
evaluate_matrix = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)] # 第一层的估值矩阵
# evaluate_matrix2 = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)] # 第二层的估值矩阵
Max = -100000
rx, ry = 0, 0
for i in range(min_tx1, max_tx1 + 1):
for j in range(min_ty1, max_ty1 + 1):
cut_flag = 0 # 剪枝标记
evaluate_matrix2 = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)]
if matrix[i][j] == 0:
matrix[i][j] = color_flag
min_tx2, min_ty2, max_tx2, max_ty2 = is_out(min_tx1, min_ty1, max_tx1, max_ty1)
[list_h, list_v, list_s, list_b] = get_list(i, j, color_flag)
eva1 = evaluate_node(list_h, list_v, list_s, list_b)
for ii in range(min_tx2, max_tx2 + 1):
for jj in range(min_ty2, max_ty2 + 1):
if matrix[ii][jj] == 0:
matrix[ii][jj] = -color_flag
[list_h, list_v, list_s, list_b] = get_list(ii, jj, -color_flag)
eva2 = -evaluate_node(list_h, list_v, list_s, list_b) #* 2
evaluate_matrix2[ii][jj] = eva2 + eva1
matrix[ii][jj] = 0
# 剪枝
if evaluate_matrix2[ii][jj] < Max:
evaluate_matrix[i][j] = evaluate_matrix2[ii][jj]
if alpha_beta_flag == 1:
cut_flag = 1
break
if cut_flag:
break
if cut_flag == 0:
Min = 100000
for ii in range(min_tx2, max_tx2 + 1):
for jj in range(min_ty2, max_ty2 + 1):
if evaluate_matrix2[ii][jj] < Min and matrix[ii][jj] == 0:
Min = evaluate_matrix2[ii][jj]
evaluate_matrix[i][j] = Min
if Max < Min:
Max = Min
rx, ry = i, j
matrix[i][j] = 0
time_end = time.time()
print("Time cost:", round(time_end - time_start, 4), "s")
add_chess(rx, ry, color_flag)
movements = [] # 记录移动步骤
# 添加棋子
def add_chess(x, y, color):
global step, matrix
step = step + 1
movements.append((x, y, color, step))
matrix[x][y] = color
xy_range(x, y)
game_is_or_not_over()
# 绘制文本
def draw_text(surf, text, size, x, y, color):
font_name = "arial"
font = pygame.font.SysFont(font_name, size)
text_surface = font.render(text, True, color)
text_rect = text_surface.get_rect()
text_rect.center = (x, y)
surf.blit(text_surface, text_rect)
# 绘制棋子
def draw_movements(surf):
for move in movements:
if move[2] == color_flag:
if color_choice == 1:
pygame.draw.circle(surf, WHITE, (move[0] * GRID_WIDTH, move[1] * GRID_WIDTH), 16)
draw_text(surf, str(move[3]), 10, move[0] * GRID_WIDTH, move[1] * GRID_WIDTH, BLACK)
else:
pygame.draw.circle(surf, BLACK, (move[0] * GRID_WIDTH, move[1] * GRID_WIDTH), 16)
draw_text(surf, str(move[3]), 10, move[0] * GRID_WIDTH, move[1] * GRID_WIDTH, WHITE)
else:
if color_choice == 1:
pygame.draw.circle(surf, BLACK, (move[0] * GRID_WIDTH, move[1] * GRID_WIDTH), 16)
draw_text(surf, str(move[3]), 10, move[0] * GRID_WIDTH, move[1] * GRID_WIDTH, WHITE)
else:
pygame.draw.circle(surf, WHITE, (move[0] * GRID_WIDTH, move[1] * GRID_WIDTH), 16)
draw_text(surf, str(move[3]), 10, move[0] * GRID_WIDTH, move[1] * GRID_WIDTH, BLACK)
# 玩家行棋
def player_go(pos):
x = round(pos[0] / GRID_WIDTH)
y = round(pos[1] / GRID_WIDTH)
if 1 <= x <= SIZE and 1 <= y <= SIZE and matrix[x][y] == 0:
add_chess(x, y, -color_flag)
return True
# 判断游戏是否结束
def game_is_or_not_over():
global win_flag, game_over
x = movements[-1][0]
y = movements[-1][1]
color = movements[-1][2]
[list_h, list_v, list_s, list_b] = get_list(x, y, color)
if sum(list_h[1:-1]) >= 5 or sum(list_v[1:-1]) >= 5 or sum(list_s[1:-1]) >= 5 or sum(list_b[1:-1]) >= 5:
win_flag = color
game_over = True
# 开始界面显示
def show_go_screen(surf):
global win_flag, movements, step, matrix, min_x, min_y, max_x, max_y, game_over
if win_flag != 0:
if color_choice == 1: #选择黑棋
draw_text(surf, "{0} win!!".format("WHITE" if win_flag == 1 else "BLACK"), 64, WIDTH // 2, 350, RED)
else:
draw_text(surf, "{0} win!!".format("BLACK" if win_flag == 1 else "WHITE"), 64, WIDTH // 2, 350, RED)
else:
screen.blit(background, back_rect)
draw_text(surf, "Five In A Row", 64, WIDTH // 2, 100, BLUE)
draw_text(surf, "Press space to start", 22, WIDTH // 2, 500, BLUE)
pygame.display.flip()
win_flag = 0
movements = []
step = 0
matrix = [[0 for i in range(SIZE + 2)] for j in range(SIZE + 2)]
min_x, min_y, max_x, max_y = 0, 0, 0, 0
game_over = False
waiting = True
while waiting:
clock.tick(FPS)
for e in pygame.event.get():
if e.type == pygame.QUIT:
pygame.quit()
sys.exit()
elif e.type == pygame.KEYDOWN:
if e.key == pygame.K_SPACE:
ai_go()
waiting = False
running = True
game_over = True
# 主循环
while running:
if game_over:
show_go_screen(screen)
clock.tick(FPS)
if color_choice == 0: #用户选择白棋，黑棋先走
if step % 2 == 0:
ai_go()
else:
for event in pygame.event.get():
if event.type == pygame.QUIT:
running = False
elif event.type == pygame.MOUSEBUTTONDOWN:
player_go(event.pos)
else:
if step % 2 == 1:
ai_go()
else:
for event in pygame.event.get():
if event.type == pygame.QUIT:
running = False
elif event.type == pygame.MOUSEBUTTONDOWN:
player_go(event.pos)
draw_background(screen)
draw_movements(screen)
pygame.display.flip()
pygame.quit()
sys.exit()
if event.type == pygame.QUIT:
running = False
elif event.type == pygame.MOUSEBUTTONDOWN:
player_go(event.pos)
else:
if step % 2 == 1:
ai_go()
else:
for event in pygame.event.get():
if event.type == pygame.QUIT:
running = False
elif event.type == pygame.MOUSEBUTTONDOWN:
player_go(event.pos)
draw_background(screen)
draw_movements(screen)
pygame.display.flip()
pygame.quit()
sys.exit()