mirror of
https://github.com/RGBCube/serenity
synced 2025-07-25 21:07:35 +00:00
Services: Move to Userland/Services/
This commit is contained in:
parent
4055b03291
commit
c7ac7e6eaf
170 changed files with 4 additions and 4 deletions
8
Userland/Services/ChessEngine/CMakeLists.txt
Normal file
8
Userland/Services/ChessEngine/CMakeLists.txt
Normal file
|
@ -0,0 +1,8 @@
|
|||
set(SOURCES
|
||||
ChessEngine.cpp
|
||||
main.cpp
|
||||
MCTSTree.cpp
|
||||
)
|
||||
|
||||
serenity_bin(ChessEngine)
|
||||
target_link_libraries(ChessEngine LibChess LibCore)
|
76
Userland/Services/ChessEngine/ChessEngine.cpp
Normal file
76
Userland/Services/ChessEngine/ChessEngine.cpp
Normal file
|
@ -0,0 +1,76 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright notice, this
|
||||
* list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||||
* this list of conditions and the following disclaimer in the documentation
|
||||
* and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "ChessEngine.h"
|
||||
#include "MCTSTree.h"
|
||||
#include <LibCore/ElapsedTimer.h>
|
||||
|
||||
using namespace Chess::UCI;
|
||||
|
||||
void ChessEngine::handle_uci()
|
||||
{
|
||||
send_command(IdCommand(IdCommand::Type::Name, "ChessEngine"));
|
||||
send_command(IdCommand(IdCommand::Type::Author, "the SerenityOS developers"));
|
||||
send_command(UCIOkCommand());
|
||||
}
|
||||
|
||||
void ChessEngine::handle_position(const PositionCommand& command)
|
||||
{
|
||||
// FIXME: Implement fen board position.
|
||||
ASSERT(!command.fen().has_value());
|
||||
m_board = Chess::Board();
|
||||
for (auto& move : command.moves()) {
|
||||
ASSERT(m_board.apply_move(move));
|
||||
}
|
||||
}
|
||||
|
||||
void ChessEngine::handle_go(const GoCommand& command)
|
||||
{
|
||||
// FIXME: A better algorithm than naive mcts.
|
||||
// FIXME: Add different ways to terminate search.
|
||||
ASSERT(command.movetime.has_value());
|
||||
|
||||
srand(arc4random());
|
||||
|
||||
Core::ElapsedTimer elapsed_time;
|
||||
elapsed_time.start();
|
||||
|
||||
MCTSTree mcts(m_board);
|
||||
|
||||
// FIXME: optimize simulations enough for use.
|
||||
mcts.set_eval_method(MCTSTree::EvalMethod::Heuristic);
|
||||
|
||||
int rounds = 0;
|
||||
while (elapsed_time.elapsed() <= command.movetime.value()) {
|
||||
mcts.do_round();
|
||||
++rounds;
|
||||
}
|
||||
dbg() << "MCTS finished " << rounds << " rounds.";
|
||||
dbg() << "MCTS evaluation " << mcts.expected_value();
|
||||
auto best_move = mcts.best_move();
|
||||
dbg() << "MCTS best move " << best_move.to_long_algebraic();
|
||||
send_command(BestMoveCommand(best_move));
|
||||
}
|
49
Userland/Services/ChessEngine/ChessEngine.h
Normal file
49
Userland/Services/ChessEngine/ChessEngine.h
Normal file
|
@ -0,0 +1,49 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright notice, this
|
||||
* list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||||
* this list of conditions and the following disclaimer in the documentation
|
||||
* and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <LibChess/Chess.h>
|
||||
#include <LibChess/UCIEndpoint.h>
|
||||
|
||||
class ChessEngine : public Chess::UCI::Endpoint {
|
||||
C_OBJECT(ChessEngine)
|
||||
public:
|
||||
virtual ~ChessEngine() override { }
|
||||
|
||||
ChessEngine() { }
|
||||
ChessEngine(NonnullRefPtr<Core::IODevice> in, NonnullRefPtr<Core::IODevice> out)
|
||||
: Endpoint(in, out)
|
||||
{
|
||||
}
|
||||
|
||||
virtual void handle_uci();
|
||||
virtual void handle_position(const Chess::UCI::PositionCommand&);
|
||||
virtual void handle_go(const Chess::UCI::GoCommand&);
|
||||
|
||||
private:
|
||||
Chess::Board m_board;
|
||||
};
|
180
Userland/Services/ChessEngine/MCTSTree.cpp
Normal file
180
Userland/Services/ChessEngine/MCTSTree.cpp
Normal file
|
@ -0,0 +1,180 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright notice, this
|
||||
* list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||||
* this list of conditions and the following disclaimer in the documentation
|
||||
* and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "MCTSTree.h"
|
||||
#include <AK/String.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
MCTSTree::MCTSTree(const Chess::Board& board, double exploration_parameter, MCTSTree* parent)
|
||||
: m_parent(parent)
|
||||
, m_exploration_parameter(exploration_parameter)
|
||||
, m_board(board)
|
||||
{
|
||||
if (m_parent)
|
||||
m_eval_method = m_parent->eval_method();
|
||||
}
|
||||
|
||||
MCTSTree& MCTSTree::select_leaf()
|
||||
{
|
||||
if (!expanded() || m_children.size() == 0)
|
||||
return *this;
|
||||
|
||||
MCTSTree* node = nullptr;
|
||||
double max_uct = -double(INFINITY);
|
||||
for (auto& child : m_children) {
|
||||
double uct = child.uct(m_board.turn());
|
||||
if (uct >= max_uct) {
|
||||
max_uct = uct;
|
||||
node = &child;
|
||||
}
|
||||
}
|
||||
ASSERT(node);
|
||||
return node->select_leaf();
|
||||
}
|
||||
|
||||
MCTSTree& MCTSTree::expand()
|
||||
{
|
||||
ASSERT(!expanded() || m_children.size() == 0);
|
||||
|
||||
if (!m_moves_generated) {
|
||||
m_board.generate_moves([&](Chess::Move move) {
|
||||
Chess::Board clone = m_board;
|
||||
clone.apply_move(move);
|
||||
m_children.append(make<MCTSTree>(clone, m_exploration_parameter, this));
|
||||
return IterationDecision::Continue;
|
||||
});
|
||||
m_moves_generated = true;
|
||||
}
|
||||
|
||||
if (m_children.size() == 0) {
|
||||
return *this;
|
||||
}
|
||||
|
||||
for (auto& child : m_children) {
|
||||
if (child.m_simulations == 0) {
|
||||
return child;
|
||||
}
|
||||
}
|
||||
ASSERT_NOT_REACHED();
|
||||
}
|
||||
|
||||
int MCTSTree::simulate_game() const
|
||||
{
|
||||
ASSERT_NOT_REACHED();
|
||||
Chess::Board clone = m_board;
|
||||
while (!clone.game_finished()) {
|
||||
clone.apply_move(clone.random_move());
|
||||
}
|
||||
return clone.game_score();
|
||||
}
|
||||
|
||||
int MCTSTree::heuristic() const
|
||||
{
|
||||
if (m_board.game_finished())
|
||||
return m_board.game_score();
|
||||
|
||||
double winchance = max(min(double(m_board.material_imbalance()) / 6, 1.0), -1.0);
|
||||
|
||||
double random = double(rand()) / RAND_MAX;
|
||||
if (winchance >= random)
|
||||
return 1;
|
||||
if (winchance <= -random)
|
||||
return -1;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void MCTSTree::apply_result(int game_score)
|
||||
{
|
||||
m_simulations++;
|
||||
m_white_points += game_score;
|
||||
|
||||
if (m_parent)
|
||||
m_parent->apply_result(game_score);
|
||||
}
|
||||
|
||||
void MCTSTree::do_round()
|
||||
{
|
||||
auto& node = select_leaf().expand();
|
||||
|
||||
int result;
|
||||
if (m_eval_method == EvalMethod::Simulation) {
|
||||
result = node.simulate_game();
|
||||
} else {
|
||||
result = node.heuristic();
|
||||
}
|
||||
node.apply_result(result);
|
||||
}
|
||||
|
||||
Chess::Move MCTSTree::best_move() const
|
||||
{
|
||||
int score_multiplier = (m_board.turn() == Chess::Color::White) ? 1 : -1;
|
||||
|
||||
Chess::Move best_move = { { 0, 0 }, { 0, 0 } };
|
||||
double best_score = -double(INFINITY);
|
||||
ASSERT(m_children.size());
|
||||
for (auto& node : m_children) {
|
||||
double node_score = node.expected_value() * score_multiplier;
|
||||
if (node_score >= best_score) {
|
||||
// The best move is the last move made in the child.
|
||||
best_move = node.m_board.moves()[node.m_board.moves().size() - 1];
|
||||
best_score = node_score;
|
||||
}
|
||||
}
|
||||
|
||||
return best_move;
|
||||
}
|
||||
|
||||
double MCTSTree::expected_value() const
|
||||
{
|
||||
if (m_simulations == 0)
|
||||
return 0;
|
||||
|
||||
return double(m_white_points) / m_simulations;
|
||||
}
|
||||
|
||||
double MCTSTree::uct(Chess::Color color) const
|
||||
{
|
||||
// UCT: Upper Confidence Bound Applied to Trees.
|
||||
// Kocsis, Levente; Szepesvári, Csaba (2006). "Bandit based Monte-Carlo Planning"
|
||||
|
||||
// Fun fact: Szepesvári was my data structures professor.
|
||||
double expected = expected_value() * ((color == Chess::Color::White) ? 1 : -1);
|
||||
return expected + m_exploration_parameter * sqrt(log(m_parent->m_simulations) / m_simulations);
|
||||
}
|
||||
|
||||
bool MCTSTree::expanded() const
|
||||
{
|
||||
if (!m_moves_generated)
|
||||
return false;
|
||||
|
||||
for (auto& child : m_children) {
|
||||
if (child.m_simulations == 0)
|
||||
return false;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
67
Userland/Services/ChessEngine/MCTSTree.h
Normal file
67
Userland/Services/ChessEngine/MCTSTree.h
Normal file
|
@ -0,0 +1,67 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright notice, this
|
||||
* list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||||
* this list of conditions and the following disclaimer in the documentation
|
||||
* and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <AK/Function.h>
|
||||
#include <AK/NonnullOwnPtrVector.h>
|
||||
#include <LibChess/Chess.h>
|
||||
#include <math.h>
|
||||
|
||||
class MCTSTree {
|
||||
public:
|
||||
enum EvalMethod {
|
||||
Simulation,
|
||||
Heuristic,
|
||||
};
|
||||
|
||||
MCTSTree(const Chess::Board& board, double exploration_parameter = sqrt(2), MCTSTree* parent = nullptr);
|
||||
|
||||
MCTSTree& select_leaf();
|
||||
MCTSTree& expand();
|
||||
int simulate_game() const;
|
||||
int heuristic() const;
|
||||
void apply_result(int game_score);
|
||||
void do_round();
|
||||
|
||||
Chess::Move best_move() const;
|
||||
double expected_value() const;
|
||||
double uct(Chess::Color color) const;
|
||||
bool expanded() const;
|
||||
|
||||
EvalMethod eval_method() const { return m_eval_method; }
|
||||
void set_eval_method(EvalMethod method) { m_eval_method = method; }
|
||||
|
||||
private:
|
||||
NonnullOwnPtrVector<MCTSTree> m_children;
|
||||
MCTSTree* m_parent { nullptr };
|
||||
int m_white_points { 0 };
|
||||
int m_simulations { 0 };
|
||||
bool m_moves_generated { false };
|
||||
double m_exploration_parameter;
|
||||
EvalMethod m_eval_method { EvalMethod::Simulation };
|
||||
Chess::Board m_board;
|
||||
};
|
49
Userland/Services/ChessEngine/main.cpp
Normal file
49
Userland/Services/ChessEngine/main.cpp
Normal file
|
@ -0,0 +1,49 @@
|
|||
/*
|
||||
* Copyright (c) 2020, the SerenityOS developers.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright notice, this
|
||||
* list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
||||
* this list of conditions and the following disclaimer in the documentation
|
||||
* and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||||
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||||
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||||
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "ChessEngine.h"
|
||||
#include <LibCore/EventLoop.h>
|
||||
#include <LibCore/File.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
if (pledge("stdio shared_buffer accept unix rpath cpath fattr", nullptr) < 0) {
|
||||
perror("pledge");
|
||||
return 1;
|
||||
}
|
||||
Core::EventLoop loop;
|
||||
if (pledge("stdio shared_buffer unix", nullptr) < 0) {
|
||||
perror("pledge");
|
||||
return 1;
|
||||
}
|
||||
if (unveil(nullptr, nullptr) < 0) {
|
||||
perror("unveil");
|
||||
return 1;
|
||||
}
|
||||
|
||||
auto engine = ChessEngine::construct(Core::File::standard_input(), Core::File::standard_output());
|
||||
return loop.exec();
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue