Skip to content
/ Robot Public

A robot must reach a goal in a place full of object to avoid. Use a discovery algorithm breadthFirstSearch.

Notifications You must be signed in to change notification settings

jdayssol/Robot

Repository files navigation

Hello!

Thanks for reading my work! I try to use class, tdd, and to write clean code. To use my application, launch the main method in the main class, or type java OttoRobot.jar in a windows command. In the main method, you can type any kind of room, robot and goal. Just follow the instructions.

Here's are the exercice example: [O,O,O,O,O,O,O,O],[O,O,O,O,O,O,O,O],[O,X,X,O,O,O,O,O],[O,O,X,O,O,O,O,O],[X,O,X,O,O,O,O,O],[O,O,X,O,O,O,O,O],[O,O,X,O,O,O,O,O],[O,O,X,O,O,O,O,O] 0,0,N 7,7

Here's a small one: [X,O],[O,O] 0,0,N 1,1

The result is showed this way:

The path or the robot is this way: OOOOOOOG SSSSSSSS SXXOOOOO SSXOOOOO XSXOOOOO OSXOOOOO OSXOOOOO SSXOOOOO

The result is this path: RFLFFFFLFRFFRFFFFFFFLF

About

A robot must reach a goal in a place full of object to avoid. Use a discovery algorithm breadthFirstSearch.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages