Timeline for How does "Monte-Carlo search" work?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 22, 2021 at 18:13 | history | edited | nbro | CC BY-SA 4.0 |
deleted 1 character in body; edited tags
|
| Apr 2, 2020 at 14:29 | comment | added | episodeyang | It is Monte Carlo tree search instead of just Monte Carlo search. MCS is more general and assumes less structure. | |
| Apr 9, 2019 at 17:39 | comment | added | nbro | A nice description of the MCTS algorithm can be found at: https://towardsdatascience.com/monte-carlo-tree-search-in-reinforcement-learning-b97d3e743d0f. | |
| May 16, 2017 at 4:33 | history | edited | Dawny33 | CC BY-SA 3.0 |
added 1 character in body
|
| Jan 16, 2017 at 17:58 | vote | accept | Dawny33 | ||
| Aug 9, 2016 at 18:57 | history | edited | kenorb |
Renaming tag, see: http://meta.ai.stackexchange.com/a/1113/8
|
|
| Aug 6, 2016 at 18:30 | history | reopened |
kenorb Disenchanted Lurker Dawny33 Florida Mithical♦ |
||
| Aug 6, 2016 at 11:47 | review | Reopen votes | |||
| Aug 6, 2016 at 18:30 | |||||
| Aug 6, 2016 at 5:02 | history | closed |
Franck Dernoncourt Ben N Enamul Hassan Box Box Box Box Rathony |
Not suitable for this site | |
| Aug 5, 2016 at 18:54 | review | Close votes | |||
| Aug 6, 2016 at 5:02 | |||||
| Aug 5, 2016 at 9:32 | answer | added | Disenchanted Lurker | timeline score: 15 | |
| Aug 5, 2016 at 7:03 | history | asked | Dawny33 | CC BY-SA 3.0 |