In this assignment, students will develop a $2$D maze game where the player navigates through a

maze to reach a goal position. The game will incorporate pathfinding using Dijkstra's algorithm

to guide the player through the maze efficiently.

Game Description:

$1.$ Game Environment: Create a $2$D grid$-$based maze environment where each cell represents a

tile in the maze. Some cells may contain walls that block movement, while others are open for

traversal.

$2.$ Player Character: Implement a player character that can move within the maze using arrow

keys or a similar input mechanism. It can be a special character on the screen. Sophisticated

graphics is not required.

$3.$ Goal Position: Place a goal position within the maze that the player must reach to win the

game.

$4.$ Obstacles and Challenges: Introduce obstacles or challenges within the maze, such as moving

obstacles, traps, or enemy characters, to increase the game's difficulty and complexity.

Pathfinding with Dijkstra's Algorithm:

$1.$ Graph Representation: Represent the maze as a graph, where each cell is a vertex, and

adjacent cells are connected by edges. Assign weights to edges based on the distance between

adjacent cells.

$2.$ Dijkstra's Algorithm Implementation: Implement Dijkstra's algorithm to find the shortest path

from the player's current position to the goal position within the maze.

$3.$ Path Visualization: Visualize the shortest path found by Dijkstra's algorithm on the game

screen to guide the player through the maze.