put ( snake, 0 ) came_from = came_from ] = None cost_so_far ] = 0 while frontier : current = frontier. remove ( s ) frontier = PriorityQueue () frontier. append () # get rid of snake blocks from available nodes for s in snake : s = list ( s ) allnodes. join ( 'font.ttf' ), 100 ) up_pressed = False right_pressed = False down_pressed = False left_pressed = False countdown = True # BEGIN EDIT findnewpath = True startcount = 0 onpath = False # END EDIT while running : # BEGIN EDIT startcount += 1 if findnewpath = True and startcount & amp gt 5 : allnodes = for x in xrange ( 32, 982, 10 ): for y in xrange ( 64, 684, 10 ): allnodes. join ( 'font.ttf' ), 28 ) countdown_font = pygame. Rect ( 12, 694, 1000, 20 ) snake = direction = 'UP' bonus_timer = 0 food = new_food ( screen, snake ) bonus = None eaten = True eaten_cooldown = 1 x_change = 0 y_change = 0 score = 0 font = pygame. append ( neighbour ) return result def h ( food, n ): # Manhattan distance return abs ( food - n ) + abs ( food - n ) # END EDIT running = True time = 0 WHITE = ( 255, 255, 255 ) BLUE = ( 0, 0, 205 ) upper_border = pygame. append () dirs =, ,, ] def neighbours ( node ): result = for d in dirs : neighbour = + d, node + d ] if neighbour in allnodes : result. #! /usr/bin/env python from game_calc import * from Queue import * import random def game ( screen, clock ): # START EDIT allnodes = for x in xrange ( 32, 982, 10 ): for y in xrange ( 64, 684, 10 ): allnodes. I don’t think this lag will be very good for Spelunky, but I think there’ll be a smaller search space per moment in that game and hopefully C++ will make it run faster (idk, we’ll see). It was quite a bit of work, but it turned out pretty well didn’t it? :) There’s a bit of lag I guess because it has to calculate the path with such a large grid. Everything else was written and belongs to Rosenqvist.īasically, I had to set up the algorithm, run it after 5 frames at the start and whenever the snake eats a piece of food, make the snake change direction based on the path calculated and draw the path on the screen. The only file that I modified was game.py and the edits are between the “BEGIN EDIT” and “END EDIT”.
#How to play screen snake code
Here is a video demonstrating the agent that I made:īitsnake’s code took a little while to understand but I decided to write over it. A* is pretty simple to understand, it basically chooses a path by taking into consideration the distance from the start and the estimated distance from the goal. Using this resource and bitSnake (by Fredrik Rosenqvist), I decided to create an agent that plays the game using A. To get started with A, I decided to do something simple.
0 kommentar(er)
