Skip to content

Using A * search algorithm and GBFS search algorithm to solve the Romanian problem

License

Notifications You must be signed in to change notification settings

hassanzadehmahdi/Romanian-problem-using-Astar-and-GBFS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Romanian-problem-using-Astar-and-GBFS

Using A * search algorithm and GBFS search algorithm to solve the Romanian problem

Romanian problem:

The agent is on holiday in Romania and is currently located in the city of Arad. Agent has a flight from Bucharest tomorrow, so it can't be changed. Now you need to find the shortest path to Bucharest.

5

An example of running the program:

10

Releases

No releases published

Packages

No packages published

Languages