A New Model of Computer Go Based on Patterns

Article Preview

Abstract:

This paper proposed a new model of computer Go based on patterns and designed CGML (a new markup language based on XML)for computer Go, and applied the G/S cloud for computer Go for the first time. Connection relations (patterns) were used to construct basic model of Go. This new idea was an ideal and practical solution to the problem of computer Go.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1779-1782

Citation:

Online since:

January 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Fang Wang, Ying Peng. Positional judgement algorithm based on mathematical morphology. 2011 International Conference on Electronic & Mechanical Engineering and Information Technology. Aug. 12-14, 2011. Harbin, Heilongjiang, China. Vol. 7(2011).

DOI: 10.1109/emeit.2011.6023794

Google Scholar

[2] Ying Peng, Fang Wang. Cloud computing model based on MPI and OpenMP.2010 2nd International Conference on Computer Engineering and Technology. Chengdu, China, April 16-18, 2010. Vol. 7(2010), pp.85-87.

DOI: 10.1109/iccet.2010.5485354

Google Scholar

[3] Fang Miao, Xiang Ni. Application Research of HGML in Geo-Browser. 2nd International Conference on Information Science and Engineering, ICISE2010. December 4-6. pp.683-686.

DOI: 10.1109/icise.2010.5691882

Google Scholar

[4] Zhang, Yuan-Hong; Miao, Fang, G/S mode design in digital China technical architecture ; Source: 2nd International Conference on Information Science and Engineering, ICISE2010 - Proceedings, pp.3718-3720.

DOI: 10.1109/icise.2010.5690368

Google Scholar

[5] Ken Chen, Fang Miao, Wenhui Yang, Xirong Guo. Research on Meteorological Data Display Based on GS Model. The 2nd International Multimedia Technology Conference. (ICMT2011), 2011. P. 683-686.

DOI: 10.1109/icmt.2011.6003096

Google Scholar

[6] P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2/3): 235-256, (2002).

DOI: 10.1023/a:1013689704352

Google Scholar

[7] T. Cazenave and B. Helmstetter. Combining tactical search and monte-carlo in the game of go. IEEE CIG 2005, pp.171-175, (2005).

Google Scholar

[8] R. Coulom. Efficient selectivity and backup operators in monte-carlo tree search. In P. Ciancarini and H. J. van den Herik, editors, Proceedings of the 5th International Conference on Computers and Games, Turin, Italy, 2006, To appear.

DOI: 10.1007/978-3-540-75538-8_7

Google Scholar

[9] L. Ralaivola, L. Wu, and P. Baldi. Svm and pattern-enriched common fate graphs for the game of go. ESANN 2005, pp.485-490, (2005).

Google Scholar

[10] Gelly, S. and Silver, D. (2007). Combining Online and Offline Knowledge in UCT. ICML'07: Proceedings of the 24th International Conference on Machine Learning (ed. Z. Ghahramani), p.273–280, ACM Press, New York, NY, USA.

DOI: 10.1145/1273496.1273531

Google Scholar