BulDML at Institute of Mathematics and Informatics >
International Journal ITK >
2007 >
Volume 1 Number 2 >

Please use this identifier to cite or link to this item:

Title: Parallel between Definition of Chess Playing Program and Definition of AI
Authors: Dobrev, Dimiter
Keywords: AI Definition
Artificial Intelligence
Chess Playing Program
Issue Date: 2007
Publisher: Institute of Information Theories and Applications FOI ITHEA
Abstract: In this report we will explain some earlier papers [1, 2] which are about definition of Artificial Intelligence and about perfect AI. The definition of AI is intuitive in [1] and formal in [2]. The perfect AI is a program that satisfies the definition for AI but which is absolutely useless because of the combinatory explosion. Most people do not understand these papers because they never saw AI and that is why for them the notion of AI is too abstract. In this report we will make parallel between definition of chess playing program and definition of AI. Of course, the definition of chess playing program is useless because people already know what this is. Anyway, we will give you this definition because its construction follows closely the construction of the definition of AI. Also the results are almost the same with the only difference that we can optimise the perfect chess playing program in order to obtain a real chess playing program, but for the moment we cannot optimise the perfect AI in order to obtain a real AI. In this report we will not speak about AI. The only matter which we will observe will be about chess playing programs. If you understand the construction and the results about chess playing programs then you can read the papers [1, 2] and to see similar results about AI.
ISSN: 1313-048X
Appears in Collections:Volume 1 Number 2

Files in This Item:

File Description SizeFormat
ijitk01-2-p15.pdf113.68 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!   Creative Commons License