python连连看代码&图片资源

import sys, time import math, random import pygame import os from pygame.locals import * # 全局的设置类 class Settings: def __init__(self): # 定义游戏窗口大小，为背景图片的一半 self.screen_size = (self.screen_width, self.screen_height) = (800, 480) self.game_size = (self.game_row, self.game_col) = (6, 10) self.map_total = self.game_row * self.game_col self.element_num = 12 self.bg_color = (220, 220, 220) self.title = '人物头像连连看' self.win_image = 'images/you_win.png' self.grid_size = 80 self.scale_size = (76, 76) self.points = [] # 实例化设置对象 settings = Settings() # 图像列表映射 map_list = [] #global map_list image_list = [] # 图片按钮 class ImageBtn: __checkable = True __checked = False def __init__(self, screen, image_path, x, y, number, element): self.x = x self.y = y self.element = element self.number = number self.screen = screen self.image = pygame.image.load(image_path) # 因为图片原始大小为 200x200，所以要进行缩放 self.image = pygame.transform.scale(self.image, settings.scale_size) def __del__(self): pass def display(self): # 描边 if self.__checked: pygame.draw.rect(self.image, (0,205,205,255), (0,0,self.image.get_width()-1,self.image.get_height()-1), 2) else: pygame.draw.rect(self.image, (0,205,205,0), (0,0,self.image.get_width()-1,self.image.get_height()-1), 2) self.screen.blit(self.image, (self.x, self.y)) def hide(self): self.__checked = False self.__checkable = False # 图片不可视 self.image.fill((255, 255,240)) def is_checkable(self): return self.__checkable def click(self): self.__checked = not self.__checked return self.__checked def reset(self): self.__checked = False def get_geometry(self): return (int(self.x), int(self.y), settings.scale_size[0], settings.scale_size[1]) # 水平扫描 def horizontal_scan(points): """ 水平标定 以 p1 和 p2 所在的两个行作为基准线，然后用垂直线在有效范围内扫描， 一旦发现可行路径，直接返回。 hLine1 和 hLine2 分别是扫描的上边线和下边线 leftLimit 和 rightLimit 分别是扫描的左边线和右边线 """ column = settings.game_col p1_x = int(points[0].number % column) p1_y = int(points[0].number / column) p2_x = int(points[1].number % column) p2_y = int(points[1].number / column) # 如果 p1 和 p2 在同一行，则不符合要求 if p1_y == p2_y: return False print("Horizontal Scanning ...") # 记录两条水平基准线 # hLine1 为上水平线，hLine2 为下水平线 if p1_y < p2_y: hLine1 = p1_y hLine2 = p2_y else: hLine1 = p2_y hLine2 = p1_y # 初始化左、右边界线为 0 leftLimit = 0; rightLimit = column-1 print("top:%d, bottom:%d, left:%d, right:%d" %(hLine1, hLine2, leftLimit, rightLimit)) # 寻找左边界线 i = p1_x # 第一次扫描 # 当 i 大于 0 时，才进入循环 while i > 0: # 判断左边点是否为空 if map_list[p1_y * column+ i - 1] != 0: break # 当左边点为空时会继续扫面下一个左边点 i -= 1 leftLimit = i; print("第一次扫描(left)") print("top:%d, bottom:%d, left:%d, right:%d" %(hLine1, hLine2, leftLimit, rightLimit)) # 第二次扫描 i = p2_x while i > 0: if map_list[p2_y * column + i - 1] != 0: break i -= 1 # leftLimit 记录左边界线，该界线所在的点为空或p1、p2本身 if i > leftLimit: leftLimit = i print("第二次扫描(left)") print("top:%d, bottom:%d, left:%d, right:%d" %(hLine1, hLine2, leftLimit, rightLimit)) # 如果 leftLimit 为 0，说明p1、p2已经在外界接通了，直接返回 if leftLimit == 0: return True # 寻找右边界线 i = p1_x while i < column-1: if map_list[p1_y * column + i + 1] != 0: break; i += 1 rightLimit = i print("第一次扫描(right)") print("top:%d, bottom:%d, left:%d, right:%d" %(hLine1, hLine2, leftLimit, rightLimit)) i = p2_x while i < column-1: if map_list[p2_y * column + i + 1] != 0: break i += 1 if i < rightLimit: rightLimit = i print("第二次扫描(right)") print("top:%d, bottom:%d, left:%d, right:%d" %(hLine1, hLine2, leftLimit, rightLimit)) if rightLimit == column-1: return True # 判断 leftLimit 和 rightLimit if leftLimit > rightLimit: # 如果左边界线超出右边界线，则无法连接 print("不能相连：leftLimit > rightLimit") return False else: # 从左往右扫描 for i in range(leftLimit, rightLimit+1): print("从左往右扫描：%d -> %d"%(i, rightLimit)) j = hLine1 + 1 for j in range(hLine1+1, hLine2): print(" j=%d"%j) # 只要当前列有阻碍，马上跳出 if map_list[j * column + i] != 0: # 回退一行 #j -= 1 break j += 1 if j == hLine2: print("最复杂的水平扫描成功！") return True return False; # 垂直扫描 def vertical_scan(points): """ 垂直标定 以 p1 和 p2 所在的两个列作为基准线，然后用水平线在有效范围内扫描， 一旦发现可行路径，直接返回。 """ row = settings.game_row column = settings.game_col p1_x = int(points[0].number % column) p1_y = int(points[0].number / column) p2_x = int(points[1].number % column) p2_y = int(points[1].number / column) # 如果 p1 和 p2 在同一列，则不符合要求 if p1_x == p2_x: return False print("Vertical Scanning ...") # 记录两条垂直基准线 if p1_x < p2_x: vLine1 = p1_x # 左垂直线 vLine2 = p2_x # 右垂直线 else: vLine1 = p2_x vLine2 = p1_x # 初始化上、下边界线 topLimit = 0 bottomLimit = row-1 # 寻找上边界线 i = p1_y # 第一次扫描 # 当 i 大于 0 时，才进入循环 while i > 0: if map_list[p1_x + (i-1) * column] != 0: break # 判断上边点是否为空 i -= 1 # 当上边点为空时会继续扫面下一个上边点 topLimit = i print("第一次扫描(top)") print("top:%d, bottom:%d, left:%d, right:%d" %(topLimit, bottomLimit, vLine1, vLine2)) # 第二次扫描 i = p2_y while i > 0: if map_list[p2_x + (i-1) * column] != 0: break i -= 1 # topLimit 记录上边界线，该界线所在的点为空或p1、p2本身 if i > topLimit: topLimit = i print("第二次扫描(top)") print("top:%d, bottom:%d, left:%d, right:%d" %(topLimit, bottomLimit, vLine1, vLine2)) # 如果 topLimit 为 0，说明p1、p2已经在外界接通了，直接返回 if topLimit == 0: return True # 寻找下边界线 i = p1_y while i < row-1: if map_list[p1_x + (i+1) * column] != 0: break i += 1 bottomLimit = i print("第一次扫描(bottom)") print("top:%d, bottom:%d, left:%d, right:%d" %(topLimi