Synthesis of an efficient tactical theorem prover for the game of go

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Synthesis of an efficient tactical theorem prover for the game of go

Full text

Pdf (128 KB)

Source

ACM Computing Surveys (CSUR) archive
Volume 30 , Issue 3es (September 1998) table of contents
Special issue: electronic supplement to the September 1998 issue

Article No. 18

Year of Publication: 1998

ISSN:0360-0300

Author

Tristan Cazenave

LIP6, Université Pierre et Marie Curie

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 38, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/289121.289139 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ALLIS, L.V. 1994. Searching }or Solutions in Games and Artificial Intelligence. Ph. D. thesis, Vrije Universitat Amsterdam, Maastricht.
	2	BARKLUND, J. 1994. Metaprogramming in logic. Technical Report 80, UPMAIL, University of Uppsala, Sweden.
	3	CAZENAVE, T. 1996. Systme d'Apprentissage par Auto-Observation. Application au Jeu de Go. Ph.D. thesis, Universit Pierre et Marie Curie, Paris 6.
	4	Charles Consel , Olivier Danvy, Tutorial notes on partial evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.493-501, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158707]
	5	CONWAY, J. 1976. On Numbers and Games. Academic Press, London/New-York.
	6	FOTLAND~ D. AND YOSHIKAWA~ i. 1997. The 3rd lost-cup world-open computer-go championship. ICCA Journal 20, 4 (December), 276-278.
	7	J. P. Gallagher, Tutorial on specialisation of logic programs, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.88-98, June 14-16, 1993, Copenhagen, Denmark [doi>10.1145/154630.154640]
	8	Patricia Hill , John Lloyd, The Go¨del programming language, MIT Press, Cambridge, MA, 1994
	9	Neil D. Jones , Carsten K. Gomard , Peter Sestoft, Partial evaluation and automatic program generation, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	10	J. W. Lloyd , J. C. Shepherdson, Partial evaluation in logic programming, Journal of Logic Programming, v.11 n.3-4, p.217-242, Oct./Nov. 1991 [doi>10.1016/0743-1066(91)90027-M ]
	11	ROBSON, J.M. 1983. The complexity of go. In Proceedings IFIP (1983), pp. 413-417.
	12	VAN DEN HERIK, H. J., ALLIS, L. V., AND HERSCHBERG, I. S. 1991. Which games will survive? In D. N. L. LEvY AND D. F. BEAL Eds., Heuristic Programming in Artificial Intelligence 2, the Second Computer Olympiad, pp. 232-243. Ellis Horwood. ISBN 0-13382615-5.