Skip to content

Practice for implementing Q Learning to find the shortest distance from A to B.

Notifications You must be signed in to change notification settings

DPain/q-learning-practice

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

q-learning-practice

Practice for implementing Q Learning to find the shortest distance from A to B.

Example Diagram

Circle 1 is where the starting agent is and Circle 0 is the target. The arrows indicate how the agent can move between the circles.
Alt text

Result

Answer: Going via 1 -> 3-> 7 -> 0 is the shortest route.
Alt text

About

Practice for implementing Q Learning to find the shortest distance from A to B.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages