Realization of the chess mate solver application | Zendy

Vladan Vučković | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Realization of the chess mate solver application

Author(s) -

Vladan Vučković

Publication year - 2004

Publication title -

yugoslav journal of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.221

H-Index - 21

eISSN - 1820-743X

pISSN - 0354-0243

DOI - 10.2298/yjor0402273v

Subject(s) - computer science , solver , realization (probability) , programming language , domain (mathematical analysis) , pruning , software , code (set theory) , artificial intelligence , mathematics , mathematical analysis , statistics , set (abstract data type) , agronomy , biology

This paper presents details of the chess mate solver application, which is a part of the author’s Geniss general chess application. The problem chess is an important domain connected with solving of the chess problems. The Geniss Mate Solver (G.M.S.) application solves Mate-in-N-move problems. Main techniques used for the implementation of the application are full-width searching with Alpha-Beta pruning technique and zero evaluation function. The application is written in Delphi for Windows programming environment and the searching engine is completely coded in assembly language (about 10000 lines). This hybrid software structure enables efficient program development by using high-level programming environment and the realization of a very fast searching engine at the same time. The machine code is manually coded and could achieve above 7 million generated positions per second on the 1Ghz Celeron PC

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research