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}
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.