aboutsummaryrefslogtreecommitdiff
path: root/code/main.felan
blob: e2c056b0237375fa40752c838ace15d2bf62dd74 (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
@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 : res = 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;
};