Compare commits

...

6 Commits

Author SHA1 Message Date
Karma Riuk
e821814cd1 updated the code of main
Some checks failed
pre-release / Pre Release (push) Waiting to run
tagged-release / Tagged Release (push) Has been cancelled
2025-02-06 10:43:28 +01:00
Karma Riuk
2899820bcc created a very stupid player that plays random
moves
2025-02-06 10:43:07 +01:00
Karma Riuk
6fd9b15261 moved stickfosh to the ais folder, since we want
to create multiple versions and make them fight
2025-02-06 10:42:42 +01:00
Karma Riuk
97b3eeb984 first version of stickfosh, simply evaluates a
Some checks failed
tagged-release / Tagged Release (push) Has been cancelled
position based on the material (no AB-pruning)
2025-02-05 17:11:09 +01:00
Karma Riuk
982f933698 removed useless include 2025-02-05 17:11:00 +01:00
Karma Riuk
d21fcde21c renamed stickfosh to perft, it's more appropriate 2025-02-05 16:23:16 +01:00
7 changed files with 135 additions and 6 deletions

23
cpp/src/ais/ai.hpp Normal file
View File

@ -0,0 +1,23 @@
#pragma once
#include "../board.hpp"
#include <string>
#define DECLARE_AI(x) \
struct x : public AI { \
std::string search(std::string, int) override; \
int minimax(const Board&, int) override; \
int eval(const Board&) override; \
};
namespace ai {
struct AI {
virtual std::string search(std::string, int) = 0;
virtual int minimax(const Board&, int) = 0;
virtual int eval(const Board&) = 0;
};
DECLARE_AI(v0_random)
DECLARE_AI(v1_simple)
} // namespace ai

View File

@ -0,0 +1,8 @@
#include "ai.hpp"
std::string ai::v1_simple::search(std::string pos, int depth) {
Board b = Board::setup_fen_position(pos);
std::vector<Move> moves = b.all_legal_moves();
return moves[rand() % moves.size()].to_string();
}

97
cpp/src/ais/v1_simple.cpp Normal file
View File

@ -0,0 +1,97 @@
#include "../pieces/piece.hpp"
#include "../threadpool.hpp"
#include "ai.hpp"
#include <future>
#include <map>
static int INFINITY = std::numeric_limits<int>::max();
std::string ai::v1_simple::search(std::string pos, int depth) {
Board b = Board::setup_fen_position(pos);
ThreadPool pool(std::thread::hardware_concurrency());
std::vector<Move> moves = b.all_legal_moves();
std::map<std::string, std::future<int>> futures;
for (const Move& move : moves) {
Board tmp_board = b.make_move(move);
futures.insert(
{move.to_string(), pool.enqueue([this, tmp_board, depth]() {
return minimax(tmp_board, depth - 1);
})}
);
}
std::string best_move;
int best_eval = -INFINITY;
for (auto& [move, future] : futures) {
int eval = future.get();
if (eval > best_eval) {
best_eval = eval;
best_move = move;
}
}
return best_move;
}
int ai::v1_simple::minimax(const Board& b, int depth) {
if (b.is_checkmate_for(b.white_to_play ? White : Black))
return -INFINITY;
if (depth == 0)
return eval(b);
std::vector<Move> moves = b.all_legal_moves();
int best_evaluation = 0;
Move best_move;
for (const Move& move : moves) {
Board tmp_board = b.make_move(move);
int tmp_eval = -minimax(tmp_board, depth - 1);
best_evaluation = std::max(best_evaluation, tmp_eval);
}
return best_evaluation;
}
static int PawnValue = 100;
static int KnightValue = 300;
static int BishopValue = 320;
static int RookValue = 500;
static int QueenValue = 900;
int count_material(const Board& b, int8_t colour) {
int ret = 0;
for (int i = 0; i < 64; i++) {
if (b.colour_at(i) == colour)
switch (b.squares[i] & 0b111) {
case Piece::Pawn:
ret += PawnValue;
break;
case Piece::Knigt:
ret += KnightValue;
break;
case Piece::Bishop:
ret += BishopValue;
break;
case Piece::Rook:
ret += RookValue;
break;
case Piece::Queen:
ret += QueenValue;
break;
}
}
return ret;
}
int ai::v1_simple::eval(const Board& b) {
int white_eval = count_material(b, Colour::White);
int black_eval = count_material(b, Colour::Black);
int evaluation = white_eval - black_eval;
int perspective = b.white_to_play ? 1 : -1;
return perspective * evaluation;
}

View File

@ -1,6 +1,5 @@
#pragma once
#include <cstdint>
#include <iostream>
#include <stdexcept>
#include <string>

View File

@ -1,12 +1,14 @@
#include "board.hpp"
#include "stickfosh.hpp"
#include "ais/ai.hpp"
#include <iostream>
int main(int argc, char* argv[]) {
std::string pos =
"rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
// Board b = Board::setup_fen_position(pos);
perft();
ai::v1_simple ai;
std::string move = ai.search(pos, 4);
std::cout << move << std::endl;
return 0;
}

View File

@ -1,4 +1,4 @@
#include "stickfosh.hpp"
#include "perft.hpp"
#include "board.hpp"
#include "move.hpp"