mirror of
git://git.savannah.nongnu.org/eliot.git
synced 2024-12-25 21:59:30 +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.
61 lines
2 KiB
C++
61 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
|
|
*****************************************************************************/
|
|
|
|
#ifndef MOVE_SELECTOR_H_
|
|
#define MOVE_SELECTOR_H_
|
|
|
|
#include "logging.h"
|
|
|
|
class Round;
|
|
class BestResults;
|
|
|
|
|
|
/**
|
|
* This helper class uses various heuristics to determine which move
|
|
* is the "best" for a given situation. At the moment, only one situation
|
|
* is implemented, namely choosing an appropriate master move for duplicate
|
|
* games.
|
|
*/
|
|
class MoveSelector
|
|
{
|
|
DEFINE_LOGGER();
|
|
public:
|
|
/**
|
|
* Return a move to be used as "master move" in a duplicate game.
|
|
* The method takes the given moves and tries to find the optimal move,
|
|
* i.e. the move which maximizes the following criteria:
|
|
* - it uses as few jokers from the rack as possible
|
|
* - it offers many prefixes and/or suffixes
|
|
* - it opens the game
|
|
* - it leaves good letters in the rack
|
|
* Since these criteria may not reach their maximum for the same move,
|
|
* some compromises must be done.
|
|
*/
|
|
Round selectMaster(const BestResults &iResults) const;
|
|
|
|
private:
|
|
|
|
int evalScore(const Round &iRound) const;
|
|
int evalForJokersInRack(const Round &iRound) const;
|
|
|
|
};
|
|
|
|
#endif
|
|
|