Winter

Home * Engines * Winter

Winter, an UCI compliant open source chess engine by Jonathan Rosenthal, written in C++, released on January 08, 2018 under the terms of GPL Version 3. Winter is inspired by machine learning techniques, as applied in move ordering and in particular in evaluation, and heavily relies on C++ templates but not on any library aside from STL as it comes with its own implementations for statistics and linear algebra. Winter started its life in 2016 as a group project at ETH Zurich in a course on parallel computing along with Jonas Kuratli and Jonathan Maurer - the current release with Jonathan Rosenthal as sole author has removed the parallel portion of the code. It started to play on-line at HGM's Online Engine Blitz Tourneys in April 2017.

=Selected Features=

Board Representation

 * Bitboards
 * 8x8 Board
 * Fancy Magic Bitboards
 * BMI2 - PEXT Bitboards

Search

 * Lazy SMP (Winter 0.3)
 * Fail-Hard Iterative Deepening
 * Alpha-Beta Principal Variation Search
 * Transposition Table
 * Move Ordering is based on the linear part of a Logistic Regression classifier aka cluster analysis
 * The classifier is trained via temporal difference learning to predict whether a move will return beta
 * Classifier considers TT move, killers, move type, from square, target square, capture target, SEE, target square of last move, check and changes between forcing and unforcing moves (a capture is more likely after another capture)
 * Countermove Heuristic (Winter 0.3)
 * Selectivity
 * Null Move Reductions
 * Static Null Move Pruning
 * Late Move Reductions
 * Futility Pruning
 * Quiescence Search
 * Static Exchange Evaluation

Evaluation

 * Non standard approach relied on a mixture model, and since Winter 0.3 on Fuzzy C-Means, a more direct generalization of a tapered eval with disjoint phases aka clusters
 * Assumes positions encountered in search come from some set of k-means clusters
 * Model is trained via EM algorithm either on database games or positions sampled from search
 * For each cluster, a separate evaluation function is trained. When the evaluation function is called the relative probability a position stems from each cluster is estimated, the evaluation functions are computed and the final score is returned as the weighted average - a generalization of tapered eval with game phases
 * Parameter weights are trained via a mixture of reinforcement (temporal difference) learning and supervised learning
 * Minimizing the cross entropy loss of a Logistic Regression model for each phase
 * Training converges fast due to linear model at the heart

Misc

 * Perft
 * Print pretty Unicode chess boards

=Forum Posts=
 * Re: Tapered Eval between 4 phases by Jonathan Rosenthal, CCC, October 16, 2017 » Tapered Eval
 * Winter Released by Jonathan Rosenthal, CCC, January 08, 2018
 * Re: Winter Released by Jonathan Rosenthal, CCC, January 09, 2018
 * Windows version released by Jonathan Rosenthal, CCC, January 23, 2018


 * Winter 0.2 Release Overview and Select Games by Jonathan Rosenthal, CCC, August 20, 2018
 * Winter 0.3 Release Overview and Select Games by Jonathan Rosenthal, CCC, December 16, 2018 » TCEC Season 14

=External Links=

Chess Engine

 * GitHub - rosenthj/Winter: UCI Chess Engine

Misc

 * Winter from Wikipedia
 * Winter - Wiktionary
 * winter - Wiktionary
 * Winter (disambiguation) from Wikipedia
 * Summer and Winter Schools | ETH Zurich
 * Wintel from Wikipedia
 * AI winter from Wikipedia
 * Winter (surname) from Wikipedia
 * Edward Winter (chess historian) from Wikipedia
 * Johnny Winter - Winter Ballade, ina.fr 1970, YouTube Video
 * feat. Tommy Shannon on bass and Uncle John Turner on drums

=References=

Up one Level