This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * Unless explicitly stated otherwise all files in this repository are licensed under the Apache License Version 2.0. | |
| * This product includes software developed at Datadog (https://www.datadoghq.com/). | |
| * Copyright 2019-2020 Datadog, Inc. | |
| */ | |
| import Foundation | |
| public extension URLSession { | |
| internal typealias RequestInterceptor = HookedSession.RequestInterceptor |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # This is a very simple Python 2.7 implementation of the Information Set Monte Carlo Tree Search algorithm. | |
| # The function ISMCTS(rootstate, itermax, verbose = False) is towards the bottom of the code. | |
| # It aims to have the clearest and simplest possible code, and for the sake of clarity, the code | |
| # is orders of magnitude less efficient than it could be made, particularly by using a | |
| # state.GetRandomMove() or state.DoRandomRollout() function. | |
| # | |
| # An example GameState classes for Knockout Whist is included to give some idea of how you | |
| # can write your own GameState to use ISMCTS in your hidden information game. | |
| # | |
| # Written by Peter Cowling, Edward Powley, Daniel Whitehouse (University of York, UK) September 2012 - August 2013. |