Shulou(Shulou.com)06/02 Report--

This article mainly explains "Python how to automatically play gluttonous snake program", interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Next let the editor to take you to learn "Python how to automatically play gluttonous snake program" it!

Realize the effect

Let's see the effect first.

This is much faster than my manual, and is stand-alone, automatic play does not scold me, , the whole automatic multiplayer game will be scolded to death.

Code

Install the software first if you don't have the software, and install the pygame module if you don't have the module installed.

Pip install pygame

Import module

Import pygame,sys,time,randomfrom pygame.locals import *

Define color variabl

RedColour = pygame.Color blackColour = pygame.Color (0Magne0) whiteColour = pygame.Color (255255255) greenColour = pygame.Color (0meme255) headColour = pygame.Color (0119255)

In all subsequent divisions, in order to prevent pygame output deviation, divisor (/ /) must be taken instead of simple division (/).

Program interface

Row 0, HEIGHT row, column 0, WIDTH column fence, so the actual size is 13'13.

IGHT = 15WIDTH = 15FIELD_SIZE = HEIGHT * WIDTH# snakehead is located in the first element of the snake array HEAD = 0

Different objects are represented by numbers, because each grid on the matrix is processed into the length of the path to the food during motion, so there needs to be a large enough interval (> HEIGHT*WIDTH) between the three variables to distinguish them from each other, with lowercase generally being coordinates and uppercase representing constants.

FOOD = 0UNDEFINED = (HEIGHT + 1) * (WIDTH + 1) SNAKE = 2 * UNDEFINED

Snake is an one-dimensional array, and the following values directly add to the corresponding element to indicate movement in four directions.

LEFT =-1RIGHT = 1UP =-WIDTH # one-dimensional array, so you need to add the entire width to indicate moving up and down. DOWN = WIDTH

Error code

ERR =-2333

An one-dimensional array is used to represent two-dimensional things, and board represents a rectangular site where the snake moves, initializing the snake head at (1), and the initial snake length is 1.

Board = [0] * FIELD_SIZE # [0jol 0pl 0pl 0, …] Snake = [0] * (FIELD_SIZE+1) snake [HEAD] = 1*WIDTH+1snake_size = 1

The temporary variable corresponding to the above variable, used when the snake moves tentatively.

Tmpboard = [0] * FIELD_SIZEtmpsnake = [0] * (FIELD_SIZE+1) tmpsnake [HEAD] = 1*WIDTH+1tmpsnake_size = 1

Food: food position is initially at (4,7), best_move: direction of movement.

Food = 4 * WIDTH + 7best_move = ERR

Direction of motion array, game score (snake length)

Mov = [LEFT, RIGHT, UP, DOWN] score = 1

Check whether a cell is covered by a snake. If it is not covered, it will be free. Return true.

Def is_cell_free (idx, psize, psnake): return not (idx in psnake [: psize])

Check whether a certain position idx can move toward move.

Def is_move_possible (idx, move): flag = False if move = = LEFT: # because the actual range is 13: 13, [1 idx 13] * [1 2*WIDTH-1 13], so you can't run left when idx is 1, so take 1 flag = True if idx%WIDTH > 1 else False elif move = = RIGHT: # (2*WIDTH-1) else False elif move = = DOWN: flag = True if idx here

< (FIELD_SIZE-2*WIDTH) else False return flag 重置board board_BFS后，UNDEFINED值都变为了到达食物的路径长度。 如需要还原，则要重置它。 def board_reset(psnake, psize, pboard): for i in range(FIELD_SIZE): if i == food: pboard[i] = FOOD elif is_cell_free(i, psize, psnake): # 该位置为空 pboard[i] = UNDEFINED else: # 该位置为蛇身 pboard[i] = SNAKE 广度优先搜索遍历整个board，计算出board中每个非SNAKE元素到达食物的路径长度。 def board_BFS(pfood, psnake, pboard): queue = [] queue.append(pfood) inqueue = [0] * FIELD_SIZE found = False # while循环结束后，除了蛇的身体， # 其它每个方格中的数字为从它到食物的曼哈顿间距 while len(queue)!=0: idx = queue.pop(0)#初始时idx是食物的坐标 if inqueue[idx] == 1: continue inqueue[idx] = 1 for i in range(4):#左右上下 if is_move_possible(idx, mov[i]): if idx + mov[i] == psnake[HEAD]: found = True if pboard[idx+mov[i]] < SNAKE: # 如果该点不是蛇的身体 if pboard[idx+mov[i]] >

It doesn't matter when pboard [IDX] + 1VR # is less than, otherwise it will overwrite the existing path data. Pboard [IDX + MOV [I]] = pboard [idx] + 1 if candidate [IDX + MOV [I]] = 0: queue.append (idx+ MOV [I]) return found

Starting from the snakehead, select the shortest path from the 4 domain points around the snakehead according to the element value in board.

Def choose_shortest_safe_move (psnake, pboard): best_move = ERR min = SNAKE for i in range (4): if is_move_possible (psnake [HEAD], mov [I]) and and [psnake [head] + mov [I]] 3: result = False return result

Let the snakehead run one step toward the snaketail, regardless of the snakebody block, toward the snake tail.

Def follow_tail (): global tmpboard, tmpsnake, food, tmpsnake_size tmpsnake_size = snake_size tmpsnake = snake [:] board_reset (tmpsnake, tmpsnake_size, tmpboard) # reset virtual board tmpboard[ tmpsnaketmpboard[ tmpsnaketmpbow _ size-1]] = FOOD # Let the snake tail become food tmpboard [food] = SNAKE # make the food place a snake body board_BFS (tmpsnake [tmpboat _ size-1], tmpsnake Tmpboard) # find the path length of each position to the snake tail tmpboard [tmpsnake [tmpsnake [tmpboat _ size-1]] = SNAKE # restore the snake tail return choose_longest_safe_move (tmpsnake, tmpboard) # return to the running direction (let the snake head move 1 step)

When all kinds of options fail, randomly find a feasible direction (1 step)

Def any_possible_move (): global food, snake, snake_size, board best_move = ERR board_reset (snake, snake_size, board) board_BFS (food, snake, board) min = SNAKE for i in range (4): if is_move_possible (snake [HEAD], mov [I]) and Board [snakehead] + MOV [I]]

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.