Tested: 6th March 2019
Download rom here: https://brew.sh/ `
| const bypass = [ | |
| // function names to avoid logging | |
| ]; | |
| const collapsed = [ | |
| // function names to groupCollapsed | |
| ]; | |
| module.exports = function(babel) { | |
| const { types: t } = babel; | |
| const wrapFunctionBody = babel.template(`{ |
Tested: 6th March 2019
Download rom here: https://brew.sh/ `
| """ | |
| A minimal implementation of Monte Carlo tree search (MCTS) in Python 3 | |
| Luke Harold Miles, July 2019, Public Domain Dedication | |
| See also https://en.wikipedia.org/wiki/Monte_Carlo_tree_search | |
| https://gist.github.com/qpwo/c538c6f73727e254fdc7fab81024f6e1 | |
| """ | |
| from abc import ABC, abstractmethod | |
| from collections import defaultdict | |
| import math |
By @foldleft.bsky.social, see also Unfollow everyone on bsky.app.
https://twitter.com/YOUR_USER_NAME/following// Unfollow everyone on twitter.com, by Jamie Mason (https://twitter.com/fold_left)