-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMastermindEngine.java
More file actions
104 lines (83 loc) · 2.84 KB
/
MastermindEngine.java
File metadata and controls
104 lines (83 loc) · 2.84 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
import java.util.*;
public class MastermindEngine {
public static final int SLOTS = 4;
public static final int COLORS = 6;
private final int[] secretCode;
private final Random random = new Random();
//DP TABLE
private int[][][] feedbackTable;
private List<int[]> allCodes;
public MastermindEngine() {
secretCode = new int[SLOTS];
for (int i = 0; i < SLOTS; i++)
secretCode[i] = random.nextInt(COLORS);
allCodes = generateAllGraphVertices();
buildFeedbackTable();
}
// GRAPH GENERATION: Brute-force generation of all Vertices (V)
// Replaces recursion with iterative loops
public List<int[]> generateAllGraphVertices() {
List<int[]> vertices = new ArrayList<>();
for (int i = 0; i < COLORS; i++) {
for (int j = 0; j < COLORS; j++) {
for (int k = 0; k < COLORS; k++) {
for (int l = 0; l < COLORS; l++) {
vertices.add(new int[] { i, j, k, l });
}
}
}
}
return vertices;
}
private void buildFeedbackTable() {
int n = allCodes.size(); // 1296
feedbackTable = new int[n][n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
int[] guess = allCodes.get(i);
int[] secret = allCodes.get(j);
int[] fb = evaluateGuess(guess, secret);
feedbackTable[i][j][0] = fb[0];
feedbackTable[i][j][1] = fb[1];
}
}
}
public int[] getFeedbackDP(int[] guess, int[] secret) {
int guessID = codeToID(guess);
int secretID = codeToID(secret);
return feedbackTable[guessID][secretID];
}
public int codeToID(int[] code) {
int id = 0;
for (int i = 0; i < SLOTS; i++) {
id = id * COLORS + code[i];
}
return id;
}
public int[] evaluateGuess(int[] guess, int[] secret) {
int black = 0, white = 0;
boolean[] sUsed = new boolean[SLOTS];
boolean[] gUsed = new boolean[SLOTS];
for (int i = 0; i < SLOTS; i++) {
if (guess[i] == secret[i]) {
black++;
sUsed[i] = gUsed[i] = true;
}
}
for (int i = 0; i < SLOTS; i++) {
if (gUsed[i])
continue;
for (int j = 0; j < SLOTS; j++) {
if (!sUsed[j] && guess[i] == secret[j]) {
white++;
sUsed[j] = true;
break;
}
}
}
return new int[] { black, white };
}
public int[] getSecret() {
return secretCode.clone();
}
}