MCTS Class |
Namespace: VikingChess.Model
internal class MCTS
The MCTS type exposes the following members.
Name | Description | |
---|---|---|
![]() | Equals | (Inherited from Object.) |
![]() | evaluateBoard | |
![]() | evaluateControl |
Finds the outermost pieces on the board and scores the board appropriately.
The reason for this is that control of the outer squares in an advantage to both players.
|
![]() | Finalize | (Inherited from Object.) |
![]() | generateNodes |
Generate all possible move states for the alpha player.
|
![]() | GetHashCode | (Inherited from Object.) |
![]() | GetType | (Inherited from Object.) |
![]() | makeMove |
Performs the MCTS algorithm.
|
![]() | MemberwiseClone | (Inherited from Object.) |
![]() | PerformSteps |
Performs te four steps of the MCTS algorithm:
1. Selection.
2. Expansion.
3. Simulation.
4. Backpropogation
|
![]() | scorePieces |
Count the number of pieces on the board and score the board appropriately
|
![]() | SimulateGame | |
![]() | ToString | (Inherited from Object.) |
Name | Description | |
---|---|---|
![]() | alphaPlayer |
The alphaPlayer is the CPU player running the MCTS algorithm and score are generated in favour of this player.
|
![]() ![]() | LOSS_POINTS |
The number of points a node receives if the simulation results in a loss for the CPU player.
|
![]() ![]() | PLAYOUTS |
The number of times the steps of the MCTS algorithm run before the best node is chosen.
Increasing this value may result in a better decision by the CPU at the cost of an
increase in the time taken to produce a result and a higher memory cost.
|
![]() | root |
The root node of the game tree.
|
![]() ![]() | SIM_TURNCOUNT |
The number of moves to process during the simulation step.
|
![]() ![]() | WIN_POINTS |
The number of points a node receives if the simulation results in a win for the CPU player.
|