Albert L. Zobrist
ABSTRACT
Much attention has been given recently to the “linguistic” approach to pattern recognition. The basics ingredients of this approach are a set of primitive picture parts and a grammar whose rules compose the primitive parts into a class of pictures. The basic idea of linguistic pattern recognition is to generalize string grammars to two dimensions. This requires a generalization of “concatenation” to two dimensions. Several applications have resulted from the definition of simple picture grammars[1-4].
This field should properly be called structural pattern recognition since its basic goal is to study the processing of the structure of pictures. From this viewpoint, one may ask whether simple grammars and the present concatenation schemes are adequate for the processing of complex scenes, or whether other approaches should be sought. These questions may be answered in the affirmative by considering the case of chess. The structure of a chessboard appears to be incredibly complex, yet humans seem to recognize familiar situations by means of structural organization of the board. Thus, chess seems to be an ideal paradigm case for complex structural pattern recognition. The USC chess program was produced from these studies. The remainder of this report will give a brief description of the chess program itself.
- 1.Narasimhan, R. Syntax-directed interpretation of classes of pictures, CACM, vol. 9, no. 3, (1966). Google Scholar
Digital Library
- 2.Shaw, Alan C. Parsing of graph-representable pictures, JACM, vol. 17, no. 3, (1970). Google ScholarDigital Library
- 3.Anderson, Robert H. Syntax-directed recognition of hand printed two dimensional mathematics, (in) Interactive Systems for Experimental Applied Mathematics, Academic Press, N. Y., (1968).Google Scholar
- 4.Chang, Shih-Kuo, Picture processing grammar and its application, Information Sciences, 3 (1971).Google Scholar
- 5.Floyd, Robert W. Nondeterministic algorithms, JACM, vol. 14, no. 4, (1967). Google ScholarDigital Library
- 6.Zobrist, Albert L. A Hashing Method with Applications for Game Playing, Tech. Rep. 88, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, (1969).Google Scholar
Index Terms
- The USC chess program
Recommendations
Computer chess programs (Panel)
ACM '71: Proceedings of the 1971 26th annual conferenceLast year, during ACM'70 in New York, the First United States Computer Chess Championship was held. Six programs competed, with Northwestern University's CHESS 3.0 winning the tournament. This year at ACM'71, the Second Annual Computer Chess ...
A program for Progressive chess
In Progressive chess, rather than just making one move per turn, players play progressively longer series of moves. Combinatorial complexity generated by many sequential moves represents a difficult challenge for classic search algorithms. In this ...
Patterns for the game of chess
SugarLoafPLoP '16: Proceedings of the 11th Latin-American Conference on Pattern Languages of ProgrammingA pattern is a three-part rule, which expresses a relation between a certain context, a problem, and a solution. In a chess game, patterns are born from the combination of relationships between chess pieces and the concepts of attack and defense. There ...
Comments