Skip to content

an RL algorithm solving Flappy Bird. by setting returns R to be the number obstacles cleared upon crashing, q* : S × A → ℝ generates the expectation E(R) from the state-action pair (s, a). experiments support the conjecture that a tabular, n-step Sarsa algorithm converges to a policy π clearing arbitrarily many obstacles (confirmed up to 1,000,000)

Notifications You must be signed in to change notification settings

clay-curry/flapPy-RL

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

About

an RL algorithm solving Flappy Bird. by setting returns R to be the number obstacles cleared upon crashing, q* : S × A → ℝ generates the expectation E(R) from the state-action pair (s, a). experiments support the conjecture that a tabular, n-step Sarsa algorithm converges to a policy π clearing arbitrarily many obstacles (confirmed up to 1,000,000)

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages