mirror of
git://git.savannah.nongnu.org/eliot.git
synced 2024-12-27 09:58:08 +01:00
664eec36ed
The best move has the highest possible score, but it is also the one leading to the most interesting game. This is a subjective notion, but some heuristics can help, such as: - a move sparing a blank is better than one using it - a move with many prefixes and suffixes is better than one without extensions - a move "opening" the game is better than one blocking it - a move leaving a nice rack is better than one leaving "bad" letters At the moment, only the first heuristic is implemented.
73 lines
2 KiB
C++
73 lines
2 KiB
C++
/*****************************************************************************
|
|
* Eliot
|
|
* Copyright (C) 2013 Olivier Teulière
|
|
* Authors: Olivier Teulière <ipkiss @@ gmail.com>
|
|
*
|
|
* 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 2 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, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*****************************************************************************/
|
|
|
|
#include "move_selector.h"
|
|
#include "round.h"
|
|
#include "results.h"
|
|
|
|
#include "debug.h"
|
|
|
|
|
|
INIT_LOGGER(game, MoveSelector);
|
|
|
|
#define PLAYED_JOKER (-1000)
|
|
|
|
|
|
Round MoveSelector::selectMaster(const BestResults &iResults) const
|
|
{
|
|
ASSERT(!iResults.isEmpty(), "Nothing to select from");
|
|
|
|
// Easy case
|
|
if (iResults.size() == 1)
|
|
return iResults.get(0);
|
|
|
|
// Compare the rounds. The one with the highest score wins.
|
|
// In case of equal scores, the first one wins.
|
|
int bestIndex = 0;
|
|
int bestScore = evalScore(iResults.get(0));
|
|
for (unsigned num = 1; num < iResults.size(); ++num)
|
|
{
|
|
int score = evalScore(iResults.get(num));
|
|
if (bestScore < score)
|
|
{
|
|
bestScore = score;
|
|
bestIndex = num;
|
|
}
|
|
}
|
|
|
|
return iResults.get(bestIndex);
|
|
}
|
|
|
|
|
|
int MoveSelector::evalScore(const Round &iRound) const
|
|
{
|
|
int score = 0;
|
|
score += evalForJokersInRack(iRound);
|
|
// TODO: more heuristics
|
|
return score;
|
|
}
|
|
|
|
|
|
int MoveSelector::evalForJokersInRack(const Round &iRound) const
|
|
{
|
|
return iRound.countJokersFromRack() * PLAYED_JOKER;
|
|
}
|
|
|
|
|