A HEURISTIC FOR FINDING CHEATING IN CHESS
KJETIL K. HAUGEN
Faculty of Business Administration and Social Sciences, Molde University College, Specialized University in Logistics, Molde, NORWAY
KNUT P. HEEN Faculty of Business Administration and Social Sciences, Molde University College, Specialized University in Logistics, Molde, NORWAY
DAVID C. SMERDON School of Economics, The University of Queensland, Brisbane, AUSTRALIA
TORE NILSSEN Department of Economics University of Oslo, NORWAY
KNUT P. HEEN Faculty of Business Administration and Social Sciences, Molde University College, Specialized University in Logistics, Molde, NORWAY
DAVID C. SMERDON School of Economics, The University of Queensland, Brisbane, AUSTRALIA
TORE NILSSEN Department of Economics University of Oslo, NORWAY
Abstract This article argues by casual empirics that a low draw percent in chess may work as a simplified cheating indicator. Data from a large number of historical chess games (53331) indicate that this extremely simple heuristic may be used as a first test if suspicion of cheating arises for professional chess players. This heuristic does not prove any cheating, but it may be applied as a quick primal indicator of potential cheating behaviour for a player suspected of cheating.
Keywords
Cheating, Chess, Economics of Doping, Economics of Crime, |