Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

A chess-based kotlin implementation of the Monte Carlo Tree Search

NotificationsYou must be signed in to change notification settings

Adversing/mcts.kt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

A chess-based kotlin implementation of theMonte Carlo Tree Search which also uses theUCB1 algorithm to select the best child node to explore next during the tree search iteration.

About

A chess-based kotlin implementation of the Monte Carlo Tree Search

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

[8]ページ先頭
©2009-2025 Movatter.jp