Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
P
Projet_info
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
TRAN Alain
Projet_info
Commits
f969440d
Commit
f969440d
authored
May 02, 2020
by
TRAN Alain
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Replace AlgoRechercheMinMax_9x9.java
parent
2c34e418
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
AlgoRechercheMinMax_9x9.java
src/tictactoecodingame/AlgoRechercheMinMax_9x9.java
+2
-2
No files found.
src/tictactoecodingame/AlgoRechercheMinMax_9x9.java
View file @
f969440d
...
@@ -23,7 +23,7 @@ public class AlgoRechercheMinMax_9x9 extends AlgoRecherche {
...
@@ -23,7 +23,7 @@ public class AlgoRechercheMinMax_9x9 extends AlgoRecherche {
humain
=
_joueur1
;
humain
=
_joueur1
;
}
}
double
[]
scores
=
{-
1
,
1
,
0
};
double
[]
scores
=
{-
1
000
,
1000
,
0
};
@Override
@Override
public
Coup
meilleurCoup
(
Plateau
_plateau
,
Joueur
_joueur
,
boolean
ponder
){
public
Coup
meilleurCoup
(
Plateau
_plateau
,
Joueur
_joueur
,
boolean
ponder
){
...
@@ -125,7 +125,7 @@ public class AlgoRechercheMinMax_9x9 extends AlgoRecherche {
...
@@ -125,7 +125,7 @@ public class AlgoRechercheMinMax_9x9 extends AlgoRecherche {
for
(
int
i
=
0
;
i
<
3
;
i
++){
// abscisse de la case 3x3
for
(
int
i
=
0
;
i
<
3
;
i
++){
// abscisse de la case 3x3
for
(
int
j
=
0
;
j
<
3
;
j
++){
//ordonnée de la case 3x3
for
(
int
j
=
0
;
j
<
3
;
j
++){
//ordonnée de la case 3x3
for
(
int
k
=
0
;
k
<
3
;
k
++){
// absisse de la case 9x9
for
(
int
k
=
0
;
k
<
3
;
k
++){
// absisse de la case 9x9
for
(
int
l
=
0
;
k
<
3
;
l
++){
// ordonnée de la case 9x9
for
(
int
l
=
0
;
l
<
3
;
l
++){
// ordonnée de la case 9x9
Jeton
p
=
_plateau
.
grille9x9
[
3
*
i
+
k
][
3
*
j
+
l
];
Jeton
p
=
_plateau
.
grille9x9
[
3
*
i
+
k
][
3
*
j
+
l
];
if
(
p
!=
null
&&
p
.
getJoueur
()
==
humain
){
if
(
p
!=
null
&&
p
.
getJoueur
()
==
humain
){
if
(
_plateau
.
caseGagnante
(
_plateau
.
grille9x9
,
3
*
i
,
3
*
j
,
3
*
i
+
k
,
3
*
j
+
l
)){
// Si on gagne
if
(
_plateau
.
caseGagnante
(
_plateau
.
grille9x9
,
3
*
i
,
3
*
j
,
3
*
i
+
k
,
3
*
j
+
l
)){
// Si on gagne
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment