Maze Game

Presenter

Elio Ngjelo

Campus

Worcester State University

Sponsor

Ali Al-Faris, Department of Computer Science, Worcester State University

Schedule

Session 1, 10:30 AM - 11:15 AM [Schedule by Time][Poster Grid for Time/Location]

Location

Poster Board C18, Poster Showcase Room (163), Row 2 (C11-C20) [Poster Location Map]

Abstract

The project is about a maze-solving game using a graph-based approach. The maze is represented as a weighted, undirected graph. This means that the graph has edges that are bi-directional and have no arrows. This lets the user go both ways between points, gives them more freedom, and increases the choice that they might make. The program first asks the user for starting and destination points. Then, the user has to navigate through the maze to find the shortest path possible between the two points that they previously chose. Afterward, the player has to input the path by listing each point that they went through and the total distance of the path that they decided to take. The graph is implemented using a custom Java class that utilizes Dijkstra's algorithm to find the shortest path. The maze layout is displayed graphically to the user, with vertices representing locations and edges indicating distances, which are randomly generated to make each game feel like a new one. The program calculates the user’s chosen path, compares it with the shortest path generated by the algorithm, and then provides feedback. This is a simple but fun game to play that helps players get a simple understanding of how graphs work.

Keywords

Data Structure , Computer Science, Graphs, Java , Programming

Research Area

Computer Science

SIMILAR ABSTRACTS (BY KEYWORD)