Comparison of Search Algorithms and Heuristic Methods in the Solution of Chess Endgame Problems

ÇEŞMELİ M. Ş., Pence I., Cetisli B.

24th Signal Processing and Communication Application Conference (SIU), Zonguldak, Turkey, 16 - 19 May 2016, pp.1509-1512 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/siu.2016.7496038
  • City: Zonguldak
  • Country: Turkey
  • Page Numbers: pp.1509-1512
  • Süleyman Demirel University Affiliated: Yes


Although chess seems like a simple game, considering the quick learning of movements of the chess pieces and other rules, when a solution space is formed for movement possibilities by speculating future movements, complexity and strategic aspects of the game can be better understood. In this study, heuristic methods are utilized in order to search for deeper solutions in the chess game. This way, a person's or standard search algorithms' difficulty in scanning through movements which could amount to millions is tried to be surpassed by heuristic methods. Heuristic methods, rather than scanning the whole space, focus on promising areas and look for the best solution. The results gained from experimental studies reveal the possibility of making a deeper search, while emphasizing the advantages of using heuristic methods as a searching method in chess.