summaryrefslogtreecommitdiffstats
path: root/ai.cpp
blob: 1cab7efea46395bc9ac8b21c188e783e43ec8574 (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
/***
	This file is part of Let's play gomoku!
	Copyright (C) 2021 Aleksandr D. Goncharov (Joursoir) <chat@joursoir.net>

	This program is free software: you can redistribute it and/or modify
	it under the terms of the GNU General Public License as published by
	the Free Software Foundation, either version 3 of the License, or
	(at your option) any later version.

	This program is distributed in the hope that it will be useful,
	but WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
	GNU General Public License for more details.

	You should have received a copy of the GNU General Public License
	along with this program.  If not, see <https://www.gnu.org/licenses/>.
***/

#include <stdlib.h>
#include <time.h>

#include "ai.hpp"
#include "GameField.hpp"

enum scores {
	MIN_SCORE = -1000,
	MAX_SCORE = 1000,
	NONE_SCORE = 0,
	DRAW_SCORE = 2,
	WIN_SCORE = 10,
	LOSE_SCORE = -10
};

AI::AI(int p, int d) : player(p), max_depth(d), first_move(true)
{
	srand(time(NULL));
}

void AI::GetBestMove(int &my, int &mx, GameField field)
{
	int score = MIN_SCORE;
	int rows = field.GetRows();
	int cols = field.GetCols();

	// give chance to user :)
	if(first_move) {
		do {
			my = rand() % rows;
			mx = rand() % cols;
		} while( !field.CanMove(my, mx) );
		first_move = false;
		return;
	}

	int y, x;
	for(y = 0; y < rows; y++) {
		for(x = 0; x < cols; x++)
		{
			if(!field.CanMove(y, x))
				continue;
			field.Move(y, x);
			int result = MinMax(field, score, MAX_SCORE, 1);
			field.UndoMove(y, x);
			if(result > score) {
				score = result;
				my = y;
				mx = x;
			}
		}
	}
}

int AI::score(GameField field)
{
	int state = field.GetState();
	if(state == G_DRAW)
		return DRAW_SCORE;
	if(state == G_XPLAYER)
		return player == G_XPLAYER ? WIN_SCORE : LOSE_SCORE;
	if(state == G_OPLAYER)
		return player == G_OPLAYER ? WIN_SCORE : LOSE_SCORE;
	return NONE_SCORE;
}

//								MIN_SCORE, MAX_SCORE
int AI::MinMax(GameField field, int alpha, int beta, int depth)
{
	if(field.GetState() != G_NONE || depth >= max_depth) {
		return score(field);
	}

	int score = beta;
	int rows = field.GetRows();
	int cols = field.GetCols();

	int y, x;
	for(y = 0; y < rows; y++) {
		for(x = 0; x < cols; x++)
		{
			if(!field.CanMove(y, x))
				continue;
			field.Move(y, x);
			int result = MinMax(field, alpha, score, depth + 1);
			field.UndoMove(y, x);
			if(result < score)
				score = result;
			if(alpha >= score)
				return score;
		}
	}
	return score;
}