Skip to content

My implementation of the Monte Carlo Tree Search algorithm from scratch.

Notifications You must be signed in to change notification settings

Michael-Nath/MCTS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A Monte Carlo Tree Search (MCTS) Implementation

By Michael D. Nath

One thing that should be learned from the bitter lesson is the great power of general purpose methods, of methods that continue to scale with increased computation even as the available computation becomes very great. The two methods that seem to scale arbitrarily in this way are search and learning.

— Richard Sutton in A Bitter Lesson

About

My implementation of the Monte Carlo Tree Search algorithm from scratch.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages