Berack/upo-ai
0
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Tris

Browse Source 
- added random choice when equal
This commit is contained in:
Giacomo Bertolazzi
2024-01-11 20:38:44 +01:00
parent 86f14f2d5a
commit 70320860dc
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
src/main/java/net/berack/upo/ai/problem2/MiniMax.java
View File

@@ -1,5 +1,6 @@
package net.berack.upo.ai.problem2; package net.berack.upo.ai.problem2;
import java.security.SecureRandom;
import java.util.Objects; import java.util.Objects;
import java.util.function.BiFunction; import java.util.function.BiFunction;
import java.util.function.Function; import java.util.function.Function;
@@ -17,6 +18,7 @@ public class MiniMax<State, Action, Player> {
private BiFunction<State, Action, State> transition; private BiFunction<State, Action, State> transition;
private BiFunction<State, Player, Integer> playerGain; private BiFunction<State, Player, Integer> playerGain;
private Function<State, Action[]> actions; private Function<State, Action[]> actions;
private SecureRandom random = new SecureRandom();
/** /**
* Crea una nuova istanza dell'algoritmo MiniMax per i giochi a due concorrenti. * Crea una nuova istanza dell'algoritmo MiniMax per i giochi a due concorrenti.
@@ -58,7 +60,8 @@ public class MiniMax<State, Action, Player> {
var nextState = this.transition.apply(state, action); var nextState = this.transition.apply(state, action);
var nextValue = this.expectedGain(nextState, player, lookahead-1, false, bestGain); var nextValue = this.expectedGain(nextState, player, lookahead-1, false, bestGain);
if(nextValue > bestGain) { if(nextValue >= bestGain) {
if(nextValue == bestGain && !random.nextBoolean()) continue; //added randomicity in the decision if has equal result
bestGain = nextValue; bestGain = nextValue;
best = action; best = action;
} }