{"title":"用HDL优化MinMax算法求解Blokus Duo游戏","authors":"Hossein Borhanifar, Seyed Peyman Zolnouri","doi":"10.1109/FPT.2014.7082821","DOIUrl":null,"url":null,"abstract":"In this paper, a solution for Blokus Duo game is presented using minmax algorithm. Then, Alpha-beta pruning method is implemented on the algorithm to reduce playing time in the manner that its running speed increases significantly. Moreover, Pentobi® software as a criterion is used as a competitor and the final results for that are reported. All codes are directly written on a hardware basis using VHDL language. After being synthesized by Quartus II®, the result is implemented on DE1-SOC board which uses cyclone V FPGA.","PeriodicalId":6877,"journal":{"name":"2014 International Conference on Field-Programmable Technology (FPT)","volume":"322 1","pages":"362-365"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimize MinMax algorithm to solve Blokus Duo game by HDL\",\"authors\":\"Hossein Borhanifar, Seyed Peyman Zolnouri\",\"doi\":\"10.1109/FPT.2014.7082821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a solution for Blokus Duo game is presented using minmax algorithm. Then, Alpha-beta pruning method is implemented on the algorithm to reduce playing time in the manner that its running speed increases significantly. Moreover, Pentobi® software as a criterion is used as a competitor and the final results for that are reported. All codes are directly written on a hardware basis using VHDL language. After being synthesized by Quartus II®, the result is implemented on DE1-SOC board which uses cyclone V FPGA.\",\"PeriodicalId\":6877,\"journal\":{\"name\":\"2014 International Conference on Field-Programmable Technology (FPT)\",\"volume\":\"322 1\",\"pages\":\"362-365\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Field-Programmable Technology (FPT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FPT.2014.7082821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Field-Programmable Technology (FPT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FPT.2014.7082821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了一种利用极小极大算法求解方块对弈问题的方法。然后，对算法实施Alpha-beta剪枝方法，使算法运行速度显著提高，从而减少算法的播放时间。此外，Pentobi®软件作为标准被用作竞争对手，并报告了最终结果。所有代码都是使用VHDL语言直接在硬件基础上编写的。结果由Quartus II®合成后，在使用cyclone V FPGA的DE1-SOC板上实现。
Optimize MinMax algorithm to solve Blokus Duo game by HDL
In this paper, a solution for Blokus Duo game is presented using minmax algorithm. Then, Alpha-beta pruning method is implemented on the algorithm to reduce playing time in the manner that its running speed increases significantly. Moreover, Pentobi® software as a criterion is used as a competitor and the final results for that are reported. All codes are directly written on a hardware basis using VHDL language. After being synthesized by Quartus II®, the result is implemented on DE1-SOC board which uses cyclone V FPGA.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
