Hi there! 

One of my favorite videogames is pokémon as you can probably guess from the title. As a player I always wanted to optimize my chances of obtaining the rarest and best pokémon in the game. I have been working on an application that aims to use graph theory to analyze the game Pokémon Blue. The application explores the following questions:

Which is the rarest pokémon in the game?
Where can I find an specific pokémon and with what probabilities?
What is the place with most different species of wild pokémon?

I also included algorithms for the following: Given a certain desired team

• Find the minimum amount of places to visit to catch them and return the list of the places the player will need to visit.
• What are the routes with best probabilities to catch each pokémon from my desired team?

Check out my application at: https://www.maplesoft.com/applications/view.aspx?SID=154565.

The following are some of the results obtained in the app:

What is the most common pokémon?

I did not only considered the amount of places a pokémon can appear in but also the probabilities of it appearing in each place.

What are the connections between pokémon and places?

In my graph, I connected a pokémon and a place if such pokémon could be caught in that place. The following is an example for the pokémon Pidgey. The weights of the edges are the probabilities of finding Pidgey in each route.

Viceversa, I did the same for how a route is connected to the pokémons in it:

 

Map of the Game
I also generated a colour coded version for the map of the game: where blue means that the place is a water route, brown means it's a cave and green means it's a tall-grass route.
It's amazing what Maple's graph theory toolbox can do.

This is a simple encryption method to hide text messages

Mentioned in Arabic manuscrips with more than hundreds years old ...

PRINCIPLE :

Just the place of letters in the sentence rearranged as described below :

For example "ABCDE" we pick up the First letter "A" from the left and write it as the last letter in the Right "......A"

but this time we pick up the letter "E" as the last letter from Right and place it at the Left Side of the previous one  ".....EA"

and this cycle continue until for rest letters ... "CDBEA" .

by this way the text become hard to discover !

It is Amazing that for decoding this message you should repeat the same rearrangment algorithm several times until the readable text appears as the first "ABCDE"

EXample :

"AlbertEinstein"

"iEntsrteebilnA"

"eterbsitlnnEAi"

 "tilsnbnrEeAtie"

"rnEbenAstliiet"

"sAtnleibiEentr"

 "biieElennttArs"

"nenltEteAirisb"

"etAEitrlinsebn"

"lritnisEeAbtne"

"EseiAnbttinrel"

"tbtniAnireeslE"

"inrAeienstlbEt"

"nesitelAbrEnti"

"AlbertEinstein"

the same text appeared after 14 step cycle

Download Arabic_Cipher.mw