Simple rogue-like game
The game consists of 5 procedurally generated rooms where you have to fight a random amount of enemies where they chase you around and deal damage if they hit you. The procedurally generated rooms also can spawn health packs that allow the player to regenerate health back.
Once all the rooms have successfully been beaten you will move onto the final room. This room contains the boss, in order to beat the game you will need to defeat the boss.
Movement - W,A,S,D to move in all directions.
Aim/Fire - Use mouse to aim and MOUSE1 to shoot.
A * Searching Algorithm
The blue enemies use the A* Search Algorithm to locate the player's sprite.
def aStar(graph, start, end):
# Initialize a priority queue
Pqueue = PriorityQueue()
Pqueue.put((start), 0)
# Initialzing path and cost dictionary
path = {}
cost = {}
# Setting the starting node None and cost to 0
path[(start)] = None
cost[(start)] = 0
# Iterate while the priority queue is not empty
while not Pqueue.empty():
current = Pqueue.get()
if current == end:
# Break used to stop the astar search when the
# current node and goal node are the same
break
# Check the next neighbouring nodes of the
# current node
for next in graph.node_neighbours(vector(current)):
next = vector_to_integer(next)
# Get the next node cost
next_cost = cost[current] + graph.cost(current, next)
if next not in cost or next_cost < cost[next]:
# Get the priority by adding the next cost and
# the hueristic value
priority = next_cost + heuristicValue(vector(end), vector(next))
cost[next] = next_cost
# Puts the node into the priority queue
Pqueue.put(next, priority)
path[next] = vector(current) - vector(next)
return pathBreadth-First Searching Algorithm
Beacon items also have a chance to spawn in. This makes all the enemies attracted to the beacon's position.
Beacon Looks Like This:
def breadthfirst_search(graph, start, end):
queue = deque()
queue.append(start)
path = {}
path[start] = None
while len(queue) > 0:
current = queue.popleft()
if current == end:
break
if graph.node_neighbours(current) != None:
for next in graph.node_neighbours(current):
if vector_to_integer(next) not in path:
queue.append(next)
path[vector_to_integer(next)] = current - next
return path- You can download the game HERE
-
Made using python-pygame.
-
This project was part of an assignment with school.
-
For more information on how the project is made and the thought process behind it: Project Write-Up