Skip to content

this project is about the Graph Theory and Graph's Algorithms such as Shortest Path, BFS, TSP and more.

Notifications You must be signed in to change notification settings

netanellevine/The_Pokemon_game

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

59 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

The Pokemon game

Overview

In this task, we were asked to implement a program that simulates the most efficient way for an agent (single or more) to catch pokemon on a directed weighted graph. There are 16 stages, 0-15, at the end of each stage you get a grade, the grade is set according to the numbers of Pokemon that were caught (the higher, the better) and to the number of moves (the lower, the better). In addition, we were asked to implement as well a graphic user interface(GUI) that will demonstrate the stage and the user will be able to observe the whole process.

Short clip to demonstrate the program

short_clip.mp4

How to use:

First clone the git

git clone https://github.com/netanellevine/The_Pokemon_game.git && cd The_Pokemon_game

Run the server

java -jar Ex4_Server_v0.0.jar <case number>

Go into client_python folder and activate the exe file

cd client_python && Game.exe

About

this project is about the Graph Theory and Graph's Algorithms such as Shortest Path, BFS, TSP and more.

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages