Vecma:先进的国际象棋引擎

Manavkumar Patel, Harshit Pandey, Tarush Wagh, Ameya Deepak Hujare, Rahul Dangi
{"title":"Vecma:先进的国际象棋引擎","authors":"Manavkumar Patel, Harshit Pandey, Tarush Wagh, Ameya Deepak Hujare, Rahul Dangi","doi":"10.1109/PuneCon55413.2022.10014895","DOIUrl":null,"url":null,"abstract":"With the rapid development of personal computers and the widespread use of the world wide web, the Internet has emerge as an information carrier and has gradually replaced the traditional media such as newspapers and television, becoming the main source of information. Thus effecting the popularity of traditional games like chess. As, various chess website and app appear to be on web, but there is a gap between players and Ai bots as various challenges occurs like efficiency, intelligence of the engine and engine level to mimic different player's depth. This paper propose a unique implementation on the previously based chess AI engines which increases the efficiency of computation of every move of the game tree. Vecma engine is unique Negamax implementation of game tree along with the Ideal vector value map. Proposed model focuses on parameters which are usually excluded from the other AI engines like positional king safety, optimal Queen positional advantage and the complex pawn advancement with the vector map integration for every piece. This engine also keeps a check on heuristic functional values of the future checkmate or stalemate probabilities. We have also develop a GUI which can be used as a base for developing other AI variations. With both Vector map and Negamax tree the chess engine is far more computationally efficient as compare to other chess engines.","PeriodicalId":258640,"journal":{"name":"2022 IEEE Pune Section International Conference (PuneCon)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Vecma: An advance chess engine\",\"authors\":\"Manavkumar Patel, Harshit Pandey, Tarush Wagh, Ameya Deepak Hujare, Rahul Dangi\",\"doi\":\"10.1109/PuneCon55413.2022.10014895\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid development of personal computers and the widespread use of the world wide web, the Internet has emerge as an information carrier and has gradually replaced the traditional media such as newspapers and television, becoming the main source of information. Thus effecting the popularity of traditional games like chess. As, various chess website and app appear to be on web, but there is a gap between players and Ai bots as various challenges occurs like efficiency, intelligence of the engine and engine level to mimic different player's depth. This paper propose a unique implementation on the previously based chess AI engines which increases the efficiency of computation of every move of the game tree. Vecma engine is unique Negamax implementation of game tree along with the Ideal vector value map. Proposed model focuses on parameters which are usually excluded from the other AI engines like positional king safety, optimal Queen positional advantage and the complex pawn advancement with the vector map integration for every piece. This engine also keeps a check on heuristic functional values of the future checkmate or stalemate probabilities. We have also develop a GUI which can be used as a base for developing other AI variations. With both Vector map and Negamax tree the chess engine is far more computationally efficient as compare to other chess engines.\",\"PeriodicalId\":258640,\"journal\":{\"name\":\"2022 IEEE Pune Section International Conference (PuneCon)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Pune Section International Conference (PuneCon)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PuneCon55413.2022.10014895\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Pune Section International Conference (PuneCon)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PuneCon55413.2022.10014895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着个人电脑的迅速发展和万维网的广泛使用,互联网作为一种信息载体应运而生,并逐渐取代了报纸、电视等传统媒体,成为人们获取信息的主要来源。从而影响了国际象棋等传统游戏的普及。随着各种国际象棋网站和应用程序出现在网络上,但玩家和Ai机器人之间存在差距,因为存在各种挑战,如效率,引擎智能和引擎级别,以模仿不同玩家的深度。本文提出了一种独特的实现方法,在先前基于象棋人工智能引擎的基础上,提高了游戏树每一步的计算效率。Vecma引擎是独特的Negamax实现游戏树以及理想的矢量值图。所提出的模型关注的是通常被其他AI引擎排除的参数,如位置国王安全、最优女王位置优势和复杂的棋子推进以及每个棋子的矢量地图集成。该引擎还会检查未来将死或僵持概率的启发式函数值。我们还开发了一个GUI,可以作为开发其他AI变体的基础。使用Vector map和Negamax树,象棋引擎的计算效率比其他象棋引擎高得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vecma: An advance chess engine
With the rapid development of personal computers and the widespread use of the world wide web, the Internet has emerge as an information carrier and has gradually replaced the traditional media such as newspapers and television, becoming the main source of information. Thus effecting the popularity of traditional games like chess. As, various chess website and app appear to be on web, but there is a gap between players and Ai bots as various challenges occurs like efficiency, intelligence of the engine and engine level to mimic different player's depth. This paper propose a unique implementation on the previously based chess AI engines which increases the efficiency of computation of every move of the game tree. Vecma engine is unique Negamax implementation of game tree along with the Ideal vector value map. Proposed model focuses on parameters which are usually excluded from the other AI engines like positional king safety, optimal Queen positional advantage and the complex pawn advancement with the vector map integration for every piece. This engine also keeps a check on heuristic functional values of the future checkmate or stalemate probabilities. We have also develop a GUI which can be used as a base for developing other AI variations. With both Vector map and Negamax tree the chess engine is far more computationally efficient as compare to other chess engines.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信