国际象棋AI:机器学习和基于极大极小的国际象棋引擎

Jyoti Madake, Chinmay Deotale, Geetai Charde, S. Bhatlawande
{"title":"国际象棋AI:机器学习和基于极大极小的国际象棋引擎","authors":"Jyoti Madake, Chinmay Deotale, Geetai Charde, S. Bhatlawande","doi":"10.1109/ICONAT57137.2023.10080746","DOIUrl":null,"url":null,"abstract":"Designing Chess Engine has been a main focus of research for a long time. The paper employs a novel combination approach of Machine learning based estimator with artificial intelligence (AI) to build chess AI. The Minimax Algorithm is a decision theory-based technique implemented for reducing the load on the chess engine’s hardware. Also, Alpha-Beta Pruning algorithm is implemented to eliminate any nodes in the search tree that aren’t essential and hence makes the AI efficient. Trained estimators achieved a high accuracy of 96.77% for calculating the probability of ‘good move’. A variable depth of search tree based on the number of legal moves has also been employed for the minimax algorithm.","PeriodicalId":250587,"journal":{"name":"2023 International Conference for Advancement in Technology (ICONAT)","volume":"323 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"CHESS AI: Machine learning and Minimax based Chess Engine\",\"authors\":\"Jyoti Madake, Chinmay Deotale, Geetai Charde, S. Bhatlawande\",\"doi\":\"10.1109/ICONAT57137.2023.10080746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Designing Chess Engine has been a main focus of research for a long time. The paper employs a novel combination approach of Machine learning based estimator with artificial intelligence (AI) to build chess AI. The Minimax Algorithm is a decision theory-based technique implemented for reducing the load on the chess engine’s hardware. Also, Alpha-Beta Pruning algorithm is implemented to eliminate any nodes in the search tree that aren’t essential and hence makes the AI efficient. Trained estimators achieved a high accuracy of 96.77% for calculating the probability of ‘good move’. A variable depth of search tree based on the number of legal moves has also been employed for the minimax algorithm.\",\"PeriodicalId\":250587,\"journal\":{\"name\":\"2023 International Conference for Advancement in Technology (ICONAT)\",\"volume\":\"323 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 International Conference for Advancement in Technology (ICONAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICONAT57137.2023.10080746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference for Advancement in Technology (ICONAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICONAT57137.2023.10080746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

长期以来,象棋引擎的设计一直是研究的重点。本文采用一种基于机器学习的估计器与人工智能相结合的方法来构建国际象棋人工智能。极大极小算法是一种基于决策理论的技术,用于减少象棋引擎硬件的负载。此外,Alpha-Beta修剪算法用于消除搜索树中不重要的节点,从而使人工智能高效。经过训练的估计器在计算“好棋”的概率方面达到了96.77%的高精度。极大极小算法还采用了一种基于合法步数的变深度搜索树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CHESS AI: Machine learning and Minimax based Chess Engine
Designing Chess Engine has been a main focus of research for a long time. The paper employs a novel combination approach of Machine learning based estimator with artificial intelligence (AI) to build chess AI. The Minimax Algorithm is a decision theory-based technique implemented for reducing the load on the chess engine’s hardware. Also, Alpha-Beta Pruning algorithm is implemented to eliminate any nodes in the search tree that aren’t essential and hence makes the AI efficient. Trained estimators achieved a high accuracy of 96.77% for calculating the probability of ‘good move’. A variable depth of search tree based on the number of legal moves has also been employed for the minimax algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信