Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Dogopher
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Gabriel Santamaria
Dogopher
Commits
de571223
Commit
de571223
authored
9 months ago
by
Chloé Taurel
Browse files
Options
Downloads
Patches
Plain Diff
correction fautes :)
parent
0cf311d4
No related branches found
Branches containing commit
No related tags found
1 merge request
!10
Merge taurelch/minimax
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
game/strategy.py
+2
-2
2 additions, 2 deletions
game/strategy.py
with
2 additions
and
2 deletions
game/strategy.py
+
2
−
2
View file @
de571223
...
...
@@ -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).
# describe
s
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 to
o
long
if
len
(
legals
)
<=
5
:
strategy
:
StrategyAlphaBeta
=
self
.
players
[
current_player
-
1
]
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment