{"action":"created","issue":{"url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/6","repository_url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search","labels_url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/6/labels{/name}","comments_url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/6/comments","events_url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/6/events","html_url":"https://github.com/PetterS/monte-carlo-tree-search/issues/6","id":134067294,"number":6,"title":"Feature Request: Randomized results.","user":{"login":"Meerkov","id":8139496,"avatar_url":"https://avatars.githubusercontent.com/u/8139496?v=3","gravatar_id":"","url":"https://api.github.com/users/Meerkov","html_url":"https://github.com/Meerkov","followers_url":"https://api.github.com/users/Meerkov/followers","following_url":"https://api.github.com/users/Meerkov/following{/other_user}","gists_url":"https://api.github.com/users/Meerkov/gists{/gist_id}","starred_url":"https://api.github.com/users/Meerkov/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Meerkov/subscriptions","organizations_url":"https://api.github.com/users/Meerkov/orgs","repos_url":"https://api.github.com/users/Meerkov/repos","events_url":"https://api.github.com/users/Meerkov/events{/privacy}","received_events_url":"https://api.github.com/users/Meerkov/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":5,"created_at":"2016-02-16T18:58:11Z","updated_at":"2016-07-15T22:04:36Z","closed_at":null,"body":"This is probably out of scope, but I would like to see the following game formulation supported:\r\n\r\n\"Crazy Connect Four\" is a variant of connect four. \r\n- After each move, the current player rolls a six sided die. \r\n- If the die comes up \"6\", then the player immediately takes another full turn, including die roll.\r\n\r\nThis MCTS implementation doesn't support randomized results of a move, as each move must map to exactly 1 outcome. Since the player doesn't control the outcome of the die, there is no way to model this without modifying the tree structure, because each choice of the player can lead to two possible child states.\r\n\r\nPerhaps: Each node of the tree is instead a map<NodeHash, Node>. After calling do_move, take a hash of the state. If it doesn't exist, add it to the tree. Then navigate to the appropriate node."},"comment":{"url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/comments/233080791","html_url":"https://github.com/PetterS/monte-carlo-tree-search/issues/6#issuecomment-233080791","issue_url":"https://api.github.com/repos/PetterS/monte-carlo-tree-search/issues/6","id":233080791,"user":{"login":"theKGS","id":1698415,"avatar_url":"https://avatars.githubusercontent.com/u/1698415?v=3","gravatar_id":"","url":"https://api.github.com/users/theKGS","html_url":"https://github.com/theKGS","followers_url":"https://api.github.com/users/theKGS/followers","following_url":"https://api.github.com/users/theKGS/following{/other_user}","gists_url":"https://api.github.com/users/theKGS/gists{/gist_id}","starred_url":"https://api.github.com/users/theKGS/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/theKGS/subscriptions","organizations_url":"https://api.github.com/users/theKGS/orgs","repos_url":"https://api.github.com/users/theKGS/repos","events_url":"https://api.github.com/users/theKGS/events{/privacy}","received_events_url":"https://api.github.com/users/theKGS/received_events","type":"User","site_admin":false},"created_at":"2016-07-15T22:04:36Z","updated_at":"2016-07-15T22:04:36Z","body":"PetterS: Yes that's how I did it. Internally my MCTS implementation deals with player IDs indexed from 0 to n-1 where n is the number of players. I also had a special rule that a negative player ID in a node meant that the choice at that point was entirely random, then I wrote specific rules to manage the that withing the tree policy function.\r\n\r\nOn monday I'll probably have added back support for stochastic games in my own implementation if you want an example of how it can be implemented."}}
{"actor":{"display_login":"theKGS"}}