karma/stickfosh
1
0
Fork 0
Code Issues 2 Pull Requests Actions Packages Projects Releases Wiki Activity

minor modifications to ai v1

Browse Source
This commit is contained in:
Karma Riuk 2025-02-06 22:57:06 +01:00
parent dc6631f79c
commit e056ef0805
1 changed files with 7 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
cpp/src/model/ais/v1_simple.cpp
View File

@ -2,29 +2,20 @@
#include "../utils/threadpool.hpp" #include "../utils/threadpool.hpp"
#include "ai.hpp" #include "ai.hpp"
#include <future>
#include <map>
static int INFINITY = std::numeric_limits<int>::max(); static int INFINITY = std::numeric_limits<int>::max();
Move ai::v1_simple::_search(const Board& b) { Move ai::v1_simple::_search(const Board& b) {
ThreadPool pool(std::thread::hardware_concurrency()); ThreadPool pool(std::thread::hardware_concurrency());
std::vector<Move> moves = b.all_legal_moves();
std::map<Move, std::future<int>> futures;
for (int depth = 1; !stop_computation; depth++) {
for (const Move& move : moves) {
Board tmp_board = b.make_move(move);
futures.insert({move, pool.enqueue([&]() {
return _search(tmp_board, depth - 1);
})});
}
}
Move best_move; Move best_move;
int best_eval = -INFINITY; int best_eval = -INFINITY;
for (auto& [move, future] : futures) { std::vector<Move> moves = b.all_legal_moves();
int eval = future.get();
for (const Move& move : moves) {
Board tmp_board = b.make_move(move);
int eval = _search(tmp_board, 4);
if (!am_white)
eval *= -1;
if (eval > best_eval) { if (eval > best_eval) {
best_eval = eval; best_eval = eval;
best_move = move; best_move = move;