Skip to content
Snippets Groups Projects
Commit de571223 authored by Chloé Taurel's avatar Chloé Taurel
Browse files

correction fautes :)

parent 0cf311d4
No related branches found
No related tags found
1 merge request!10Merge taurelch/minimax
......@@ -264,7 +264,7 @@ class MCTSStrategy(Strategy):
#
# Thus, the two players in the rollout phase are AlphaBeta players with a fixed depth
# Note: the original idea was found by me, but after further research I found [2] that
# describe a clever way of doing this (way clever than what I wanted to do first).
# describes a clever way of doing this (way more clever than what I wanted to do first).
# The points that they talk about are the use of AlphaBeta algorithms not only in the
# playout phase, but also in the selection, expansion and backpropagation phases
......@@ -284,7 +284,7 @@ class MCTSStrategy(Strategy):
# Before using the Minimax strategy to choose the move,
# we check that the branching factor isn't too high to
# prevent the computing time from being to long
# prevent the computing time from being too long
if len(legals) <= 5:
strategy: StrategyAlphaBeta = self.players[current_player - 1]
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment