Home

B.S.D

Welcome to the Ex2OOP wiki!

OPEN SOURCE

WRITTEN IN JAVA

Catch 'Em All! catch pokemons ' AUTOMATED GAME' / Weighted and Directed Graph Model - 12/2020

What is this project, CATCH 'EM ALL- POKEMONS | WEIGHTED AND DIRECTED GRAPH, all about?

The project implements an automated game of catching Pokemons, going around and having fun, just resting on some nodes of a Weighted and Directed graph model, with our Agents. You can happily watch our agents try to catch the pokemons, when they need to earn the most points, By catching the most valueble pokemons.

Features 24 DIFFERENT levels! with RAISING DIFFICULITY.

Each Pokemon has a value- which effects how much points will it give to the Agent that will catch him.

Every Agent has a speed of its own- which effect how many pokemons he'll be able to catch in the time remaining of the game.

#Welcome! Let the fun begin!

Let's take a brief look inside-

Level 17!

Level 14!

Score Table:

Level 8!

Because it's a DIRECTED weighted graph,

An edge between a node with key 3 to a node with key 8 is NOT the same edge between a node with key 8 to a node with key 3!

3 --------- > 8 != 8 --------> 3

That's why

pokemons can have different colors-

to show that they're on an edge with a direction:

A YELLOW-ISH-ORANGE Pokemon is on an edge which its DESTs' nodes' key is GREATER than its SRC's nodes' key.

A GREEN Pokemon- is on an edge which its SRCs' nodes' key is GREATER than its DEST's nodes' key.

Find us at GitHub: ShaCode256@ Dvir-Segal@

-Third assignment in computer science and mathematics studies at Ariel University, second year.

@מצאו אותנו בגיטהאב ShaCode256 Dvir-Segal@

מטלה שלישית במסגרת לימודי מדעי המחשב ומתמטיקה באוניברסיטת אריאל בשומרון, שנה ב'.