Skip to content

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

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

16 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Reinforcement Learning Path Finder

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. path

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

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages