This program gives the user a choice between two reinforcement learning algorithms: Epsilon-Greedy and Lower Confidence Bound - this algorithm is then used to find the shortest path within a lattice.
-
Notifications
You must be signed in to change notification settings - Fork 0
This program gives the user a choice between two reinforment learning algorithms: Epsilon-Greedy and Lower Confidence Bound - this algorithm is then used to find the shortest path within a lattice. Click the question mark in the upper right hand corner, after following the link below, to explore all the options.
Quin-Darcy/Reinforcement-Learning-Path-Finder
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This program gives the user a choice between two reinforment learning algorithms: Epsilon-Greedy and Lower Confidence Bound - this algorithm is then used to find the shortest path within a lattice. Click the question mark in the upper right hand corner, after following the link below, to explore all the options.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published