Home * Chess * Playing Strength
FlottmannDragonSnakeIII.JPG

Playing Strength, (Performance, Skill Level)
of a chess player, or chess playing entity, program or engine, reflects the ability to win against other players, given by a number or other element of an ordered set such as an Elo number.

The ability to solve test-positions, that is, finding the specified, likely one and only best move, might be an indicator for various particular engine skills, but does not necessarily correlate with playing strength. In his Parallelism and Selectivity in Game Tree Search lecture, Tord Romstad introduced the Worst Moves Observation (WMO), which states the practical playing strength is not primarily determined by the quality of the players best moves nor average moves, but by the quality of the players worst moves.
Dragon and Snake on ambos [1]

Measuring

A statistical valid method to measure playing strength within a defined confidence interval is to play an appropriate huge number of games with both sides versus a wide range of different opponents [2] with symmetric time constraints, and to apply match statistics. Performance isn't measured absolutely; it is inferred from wins, losses, and draws against other players or engines. Players' rating depend on the ratings of their opponents, and the results scored against them [3]. While relative playing strength of chess engines is not strictly transmissive over various time controls, the number of games played is more relevant than their duration, the todays de facto standard in measuring playing strength is parallel playing fast chess with (ultra) short time control, such as blitz, bullet or even lightning chess, as for instance used in the Fishtest framework of Stockfish [4].

Strength

The strength of a chess program depends on many things, the quality and efficiency of the algorithms involved to determine the best move of a position, the balance of the so called search versus knowledge tradeoff to evaluate or compare leaf nodes of a search tree, how to shape that tree and to propagate a score up to the root, and time management, that is how to allocate time for searching a move under time control requirements. Time used is roughly proportional to the number of visited nodes of the common depth-first search inside an iterative deepening frame, which grows exponentially by its effective branching factor raised to the power of search depth. Playing strength might be improved over the (playing) time due to learning algorithms.

See also


Publications

1970 ...

1980 ...

1990 ...

2000 ...

2005 ...

2010 ...

2015 ...


Forum Posts

1990 ...

1995 ...

2000 ...

2005 ...

2008
2009

2010 ...

2011
2012
2013
2014

2015 ...

2016
2017

External Links

Chess Player

Chess Engines

Analysis

Rating Systems

Misc


References

  1. ^ Photo by Gerd Isenberg, September 18, 2016, detail of the Flottmann gate, Art Nouveau theme of Dragon and Sun designed by Carl Weinhold, art director of blacksmith and foundry Füssmann und Fleeth, Essen, exposed at the industrial and trade exhibition 1902 in Düsseldorf, and baught by Heinrich Flottmann as gate for his jackhammer factory, today adjacent to the exhibition and event space Flottmann-Hallen in Herne, North Rhine-Westphalia, Germany, and part of The Industrial Heritage Trail of the Ruhr area, "The dragon is a symbol of physical strength and intelligence with respect to the snake that symbolizes the tough, glowing wrought iron" from Flottmann-Tor – Hün un Perdün, see also Image by Gerd Biedermann, and Flottmann-Hallen - Historie (German)
  2. ^ A word for casual testers by Don Dailey, CCC, December 25, 2012
  3. ^ Elo rating system - Mathematical details - Wikipedia
  4. ^ Stockfish Testing Framework
  5. ^ Elo's Book: The Rating of Chess Players by Sam Sloan
  6. ^ Computers choose: who was the strongest player?, ChessBase News, October 30, 2006
  7. ^ Computer analysis of world champions by Søren Riis, ChessBase News, November 02, 2006
  8. ^ Bayesian inference from Wikipedia
  9. ^ How I did it: Diogo Ferreira on 4th place in Elo chess ratings competition | no free hunch
  10. ^ "Intrinsic Chess Ratings" by Regan, Haworth -- seq by Kai Middleton, CCC, November 19, 2017
  11. ^ Re: EloStat, Bayeselo and Ordo by Rémi Coulom, CCC, June 25, 2012
  12. ^ Questions regarding rating systems of humans and engines by Erik Varend, CCC, December 06, 2014
  13. ^ chess statistics scientific article by Nuno Sousa, CCC, July 06, 2016
  14. ^ Delphil 3.3b2 (2334) - Stockfish 030916 (3228), TCEC Season 9 - Rapid, Round 11, September 16, 2016
  15. ^ Normalized Elo (pdf) by Michel Van den Bergh
  16. ^ Chessanalysis homepage by Erik Varend
  17. ^ wall - Wiktionary
  18. ^ regression - Wiktionary
  19. ^ Matej Guid, Ivan Bratko (2006). Computer Analysis of World Chess Champions. ICGA Journal, Vol. 29, No. 2, pdf
  20. ^ an interesting study from Erik Varend by scandien, Hiarcs Forum, August 13, 2017

What links here?


Up one Level