mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 16:53:09 +00:00
Simplify Time Management UCI options
No functional change
This commit is contained in:
parent
cd065dd584
commit
b66552fc27
2 changed files with 5 additions and 7 deletions
|
@ -78,7 +78,7 @@ void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color u
|
|||
increment > 0 && movesToGo == 0 means: x basetime + z increment
|
||||
increment > 0 && movesToGo != 0 means: x moves in y minutes + z increment
|
||||
|
||||
Time management is adjusted by following UCI parameters:
|
||||
Time management is adjusted by following parameters:
|
||||
|
||||
emergencyMoveHorizon: Be prepared to always play at least this many moves
|
||||
emergencyBaseTime : Always attempt to keep at least this much time (in ms) at clock
|
||||
|
@ -89,9 +89,9 @@ void TimeManager::init(const Search::LimitsType& limits, int currentPly, Color u
|
|||
int hypMTG, hypMyTime, t1, t2;
|
||||
|
||||
// Read uci parameters
|
||||
int emergencyMoveHorizon = Options["Emergency Move Horizon"];
|
||||
int emergencyBaseTime = Options["Emergency Base Time"];
|
||||
int emergencyMoveTime = Options["Emergency Move Time"];
|
||||
int emergencyMoveHorizon = 40;
|
||||
int emergencyBaseTime = Options["Move Overhead"] * 2;
|
||||
int emergencyMoveTime = Options["Move Overhead"];
|
||||
int minThinkingTime = Options["Minimum Thinking Time"];
|
||||
int slowMover = Options["Slow Mover"];
|
||||
|
||||
|
|
|
@ -63,9 +63,7 @@ void init(OptionsMap& o) {
|
|||
o["Ponder"] << Option(true);
|
||||
o["MultiPV"] << Option(1, 1, 500);
|
||||
o["Skill Level"] << Option(20, 0, 20);
|
||||
o["Emergency Move Horizon"] << Option(40, 0, 50);
|
||||
o["Emergency Base Time"] << Option(60, 0, 30000);
|
||||
o["Emergency Move Time"] << Option(30, 0, 5000);
|
||||
o["Move Overhead"] << Option(30, 0, 5000);
|
||||
o["Minimum Thinking Time"] << Option(20, 0, 5000);
|
||||
o["Slow Mover"] << Option(80, 10, 1000);
|
||||
o["UCI_Chess960"] << Option(false);
|
||||
|
|
Loading…
Add table
Reference in a new issue