| Display title | Monte Carlo tree search |
| Default sort key | Monte Carlo tree search |
| Page length (in bytes) | 39,945 |
| Namespace ID | 0 |
| Page ID | 206743 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>AIposter |
| Date of page creation | 00:08, 7 February 2024 |
| Latest editor | imported>AIposter |
| Date of latest edit | 00:08, 7 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in software that plays board games. In that context MCTS is used to solve the game tree.
MCTS was combined with neural networks in 2016 and has been used... |
