An algorithm of moving pieces to become black alternation with white based on dimension reduction

[1] Liu Dun. Mathematical historical materials in some notes of Ming and Qing Dynasties [J]. Historical materials of science and technology in China, 1989 (4): 49–55 DunLiu Mathematical historical materials in some notes of Ming and Qing Dynasties [J] Historical materials of science and technology in China 1989 4 49 55 Search in Google Scholar

[2] Xu Baolu, Festschrift editorial committee. Xu Baolu festschrift [M]. Beijing university press, 2010 BaoluXu Festschrift editorial committee. Xu Baolu festschrift [M] Beijing university press 2010 Search in Google Scholar

[3] Yu Baosan, Mo Shao Kui. Theory of moving pieces to become black alternation with white [J]. Journal of mathematics, nanjing university, 1986 (1): 60–71 BaosanYu KuiMo Shao Theory of moving pieces to become black alternation with white [J] Journal of mathematics, nanjing university 1986 1 60 71 Search in Google Scholar

[4] Hu Zhuxin. Historical origin and modern development of inscriptions [M]. Shandong education press, 1986 ZhuxinHu Historical origin and modern development of inscriptions [M] Shandong education press 1986 Search in Google Scholar

[5] Pin Shanfi. East-west mathematics [M]. Ttranslation. Dai Qin. Shanghai: Shanghai education press, 2005 ShanfiPin East-west mathematics [M] Ttranslation. QinDai Shanghai Shanghai education press 2005 Search in Google Scholar

[6] Geng Ji. Mathematical entertainment (6) – moving pieces to become black alternation with white [J]. Journal of hainan university (natural science edition), 2010, 28 (1): 1–10, JiGeng Mathematical entertainment (6) – moving pieces to become black alternation with white [J] Journal of hainan university (natural science edition) 2010 28 1 1 10 Search in Google Scholar

[7] Geng Ji. Mathematical entertainment (16) – the problem of moving pieces to become black alternation with white and international scientific research results [J]. Journal of hainan university (natural science edition), 2015 (03): 197–203 JiGeng Mathematical entertainment (16) – the problem of moving pieces to become black alternation with white and international scientific research results [J] Journal of hainan university (natural science edition) 2015 03 197 203 Search in Google Scholar

[8] Sha Yanfei, Sha Bowen, Fu Pingping. Application of move chess phase method in architectural appearance design [J]. Design, 2018 (5): 140–142 YanfeiSha BowenSha PingpingFu Application of move chess phase method in architectural appearance design [J] Design 2018 5 140 142 Search in Google Scholar

[9] Zhang Guifen, Ge Lina, Huang Yinjuan. Research on kongming chess algorithm based on stack structure [J]. Computer technology and development, 2009 (12): 51–54 GuifenZhang LinaGe YinjuanHuang Research on kongming chess algorithm based on stack structure [J] Computer technology and development 2009 12 51 54 Search in Google Scholar

[10] Silver D., Huang A., Maddison C.J., et al., Mastering the game of Go with deep eural networks and tree search [J]. Nature, 2016, 529(7587): 484–489 SilverD. HuangA. MaddisonC.J. Mastering the game of Go with deep eural networks and tree search [J] Nature 2016 529 7587 484 489 10.1038/nature1696126819042 Search in Google Scholar

[11] Silver D., Schrittwieser J., Simonyan K., et al., Mastering the game of Go ithout human knowledge [J]. Nature, 2017, 550(7676):354 SilverD. SchrittwieserJ. SimonyanK. Mastering the game of Go ithout human knowledge [J] Nature 2017 550 7676 354 10.1038/nature2427029052630 Search in Google Scholar

[12] Sato N., Ikeda K., Three types of forward pruning techniques to apply the alpha beta algorithm to turn-based strategy games. 2016 IEEE Conference on Computational Intelligence and Games. 2016 SatoN. IkedaK. Three types of forward pruning techniques to apply the alpha beta algorithm to turn-based strategy games 2016 IEEE Conference on Computational Intelligence and Games 2016 10.1109/CIG.2016.7860427 Search in Google Scholar

[13] Companez N, Aleti A., Can Monte-Carlo tree search learn to sacrifice. Journal of Heuristics. 2016 CompanezN AletiA. Can Monte-Carlo tree search learn to sacrifice Journal of Heuristics 2016 10.1007/s10732-016-9320-y Search in Google Scholar

[14] Baier H, Winands M H M., Monte-Carlo tree search and minimax hybrids with heuristic evaluation functions. Proc of International Conference on Computers and Games. 2014 BaierH WinandsM H M. Monte-Carlo tree search and minimax hybrids with heuristic evaluation functions Proc of International Conference on Computers and Games 2014 10.1007/978-3-319-14923-3_4 Search in Google Scholar

[15] Silver D., Schrittwieser J., Simonyan K. et al., Mastering the Game of Go without Human Knowledge. Nature. 2017 SilverD. SchrittwieserJ. SimonyanK. Mastering the Game of Go without Human Knowledge Nature 2017 10.1038/nature24270 Search in Google Scholar

[16] Silver D., Hubert T., Schrittwieser J. et al., Mastering chess and shogi by self-play with a general reinforcement learning algorithm. 2017 SilverD. HubertT. SchrittwieserJ. Mastering chess and shogi by self-play with a general reinforcement learning algorithm 2017 Search in Google Scholar

[17] Dubey R., Agrawal P., Pathak D., et al., Investigating human priors for playing video games. 2018 DubeyR. AgrawalP. PathakD. Investigating human priors for playing video games 2018 Search in Google Scholar

[18] Andre Barreto, Diana Borsa, John Quan, et al., Transfer in deep reinforcement learning using successor features and generalised policy improvement. 2018 BarretoAndre BorsaDiana QuanJohn Transfer in deep reinforcement learning using successor features and generalised policy improvement 2018 Search in Google Scholar