blob: 715c8db5d0d97d50cebf81b33a4b04cf85084f4f (
plain)
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
@import("basic.felan");
print :: (value:[]u8)->void{
i :u64 = 0;
while i < value.length {
putc value[i];
i += @cast(1,u64);
}
};
print :: (value:i64)->void{
value := value;
str : [20]u8 = undefined;
i :u64= 19;
while {
str[i] = @cast(value % 10,u8) + '0';
i -= @cast(1,u64);
value /= 10;
value != 0;
} {}
j :u64= i+@cast(1,u64);
while j < @cast(20,u64) {
putc str[j];
j += @cast(1,u64);
}
};
println :: (value:i64)->void{
print(value);
putc '\n';
};
println :: ()->void{
putc '\n';
};
main :: () -> void {
stones := 6;
player := 1;
while stones != 0 {
c := choose_ai(stones);
print("player: ");
print(player);
print(" ---------\n");
println(stones);
println(c);
if (stones == 2 || stones == 1) && stones == c {
print("player: ");
print(player);
print(" won\n");
}
stones -= c;
player = (if (player == 1) 2 else 1);
}
};
choose_ai :: (stones_left:i64) -> i64 {
return (if (stones_left % 3 == 0) 1 else stones_left % 3);
};
*/
@import("basic.felan");
main :: () -> void {
stones := 6;
player := 1;
while stones > 0 {
r :res =minimax(stones,true);
stones -= r.move;
putc @cast(stones,u8) + '0';
putc '\n';
putc 'p';
putc @cast(player,u8) + '0';
putc '\n';
player = (if player == 2 1 else 2);
}
};
res :: struct {
move : i64;
score : i64;
};
minimax :: (currentStones:i64, isMaximizing:bool) -> res {
if currentStones <= 0 {
r : res = undefined;
r.move = 0;
r.score = (if isMaximizing {-1;} else {1;});
return r;
}
found := false;
bestMove : res = undefined;
score := (if isMaximizing {-1000000;} else {1000000;});
move := 1;
while move <= 2 {
if currentStones - move >= 0 {
found = true;
result := minimax(currentStones - move, !isMaximizing);
if isMaximizing {
if result.score > score {
bestMove.move = move;
bestMove.score = result.score;
score = result.score;
}
}else{
if result.score < score {
bestMove.move = move;
bestMove.score = result.score;
score = result.score;
}
}
}
move += 1;
}
if !found {
r : res = undefined;
r.move = 0;
r.score = (if isMaximizing {-1;} else {1;});
return r;
}
return bestMove;
};
|