Difference between revisions of "Pattern Recognition"

From Chessprogramming wiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 81: Line 81:
 
: Revised as [[Hans Berliner]], [[Carl Ebeling]] ('''1990'''). ''Hitech''. [[Computers, Chess, and Cognition]]
 
: Revised as [[Hans Berliner]], [[Carl Ebeling]] ('''1990'''). ''Hitech''. [[Computers, Chess, and Cognition]]
 
==1990 ...==  
 
==1990 ...==  
 +
* [[Simon Lucas]] ('''1991'''). ''[https://eprints.soton.ac.uk/256263/ Connectionist architectures for syntactic pattern recognition]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Southampton University of Southampton]
 
* [[Eduardo F. Morales]] ('''1992'''). ''First-Order Induction of Patterns in Chess''. Ph.D. Thesis, The Turing Institute, [https://en.wikipedia.org/wiki/University_of_Strathclyde University of Strathclyde], [https://en.wikipedia.org/wiki/Glasgow Glasgow]
 
* [[Eduardo F. Morales]] ('''1992'''). ''First-Order Induction of Patterns in Chess''. Ph.D. Thesis, The Turing Institute, [https://en.wikipedia.org/wiki/University_of_Strathclyde University of Strathclyde], [https://en.wikipedia.org/wiki/Glasgow Glasgow]
 
* [[Eduardo F. Morales]] ('''1992'''). ''Learning Chess Patterns''. Inductive Logic Programming (ed. [[Stephen Muggleton]]), Academic Press, The Apic Series, London, UK
 
* [[Eduardo F. Morales]] ('''1992'''). ''Learning Chess Patterns''. Inductive Logic Programming (ed. [[Stephen Muggleton]]), Academic Press, The Apic Series, London, UK
Line 91: Line 92:
 
* [[Reijer Grimbergen]] ('''1996'''). ''Using Pattern Recognition and Selective Deepening to Solve Tsume Shogi''. [[Conferences#GPW|3rd Game Programming Workshop]], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.7594 CiteSeerX] <ref>[https://en.wikipedia.org/wiki/Tsumeshogi Tsumeshogi from Wikipedia]</ref>
 
* [[Reijer Grimbergen]] ('''1996'''). ''Using Pattern Recognition and Selective Deepening to Solve Tsume Shogi''. [[Conferences#GPW|3rd Game Programming Workshop]], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.7594 CiteSeerX] <ref>[https://en.wikipedia.org/wiki/Tsumeshogi Tsumeshogi from Wikipedia]</ref>
 
* [https://dblp.uni-trier.de/pers/hd/g/Gelsema:Edzard_S= Edzard S. Gelsema], [[Laveen Kanal|Laveen N. Kanal]] (eds.)  ('''1997'''). ''Pattern Recognition in Practice V''. [https://en.wikipedia.org/wiki/Pattern_Recognition_Letters Pattern Recognition Letters], Vol 18, Nos. 11-13
 
* [https://dblp.uni-trier.de/pers/hd/g/Gelsema:Edzard_S= Edzard S. Gelsema], [[Laveen Kanal|Laveen N. Kanal]] (eds.)  ('''1997'''). ''Pattern Recognition in Practice V''. [https://en.wikipedia.org/wiki/Pattern_Recognition_Letters Pattern Recognition Letters], Vol 18, Nos. 11-13
 +
* [[Simon Lucas]] ('''1997'''). ''[http://www.bmva.org/bmvc/1997/papers/113/paper.htm Face recognition with the continuous n-tuple classifier]''. [https://dblp.uni-trier.de/db/conf/bmvc/bmvc1997.html BMVC 1997]
 
* [[Fernand Gobet]], [[Herbert Simon]] ('''1998'''). ''Pattern recognition makes search possible: Comments on Holding (1992)''. Psychological Research, Vol. 61, [http://v-scheiner.brunel.ac.uk/bitstream/2438/816/1/Paper_on_Holding.pdf pdf] <ref>[[Dennis H. Holding]] ('''1992'''). ''Theories of Chess Skill''. Psychological Research, Vol. 54, No. 1</ref>
 
* [[Fernand Gobet]], [[Herbert Simon]] ('''1998'''). ''Pattern recognition makes search possible: Comments on Holding (1992)''. Psychological Research, Vol. 61, [http://v-scheiner.brunel.ac.uk/bitstream/2438/816/1/Paper_on_Holding.pdf pdf] <ref>[[Dennis H. Holding]] ('''1992'''). ''Theories of Chess Skill''. Psychological Research, Vol. 54, No. 1</ref>
 
* [[Hitoshi Matsubara]], [[Steven Walczak]], [[Reijer Grimbergen]] ('''1998'''). ''Analysis of important patterns in Shogi''. The 15th Annual Meeting of the Japanese Cognitive Science Society, (Nagoya, Japan), 136-137. (in Japanese/Kanji)
 
* [[Hitoshi Matsubara]], [[Steven Walczak]], [[Reijer Grimbergen]] ('''1998'''). ''Analysis of important patterns in Shogi''. The 15th Annual Meeting of the Japanese Cognitive Science Society, (Nagoya, Japan), 136-137. (in Japanese/Kanji)
Line 111: Line 113:
 
* [[Merim Bilalić]], [http://scholar.google.com/citations?user=q_X-IPoAAAAJ&hl=de Robert Langner], [http://www.informatik.uni-trier.de/~ley/pers/hd/e/Erb:Michael.html Michael Erb], [http://rwth-aachen.academia.edu/WolfgangGrodd Wolfgang Grodd] ('''2010'''). ''[http://pubget.com/paper/21038986/Mechanisms_and_neural_basis_of_object_and_pattern_recognition__a_study_with_chess_experts Mechanisms and neural basis of object and pattern recognition: a study with chess experts]''. [https://en.wikipedia.org/wiki/Journal_of_Experimental_Psychology Journal of Experimental Psychology General], Vol. 139, No. 4
 
* [[Merim Bilalić]], [http://scholar.google.com/citations?user=q_X-IPoAAAAJ&hl=de Robert Langner], [http://www.informatik.uni-trier.de/~ley/pers/hd/e/Erb:Michael.html Michael Erb], [http://rwth-aachen.academia.edu/WolfgangGrodd Wolfgang Grodd] ('''2010'''). ''[http://pubget.com/paper/21038986/Mechanisms_and_neural_basis_of_object_and_pattern_recognition__a_study_with_chess_experts Mechanisms and neural basis of object and pattern recognition: a study with chess experts]''. [https://en.wikipedia.org/wiki/Journal_of_Experimental_Psychology Journal of Experimental Psychology General], Vol. 139, No. 4
 
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2011'''). ''Solving breakthrough with Race Patterns and Job-Level Proof Number Search''. [[Advances in Computer Games 13]], [http://www.lamsade.dauphine.fr/~cazenave/papers/solving.pdf pdf] » [[Breakthrough (Game)]], [[Proof-Number Search]]
 
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Tristan Cazenave]] ('''2011'''). ''Solving breakthrough with Race Patterns and Job-Level Proof Number Search''. [[Advances in Computer Games 13]], [http://www.lamsade.dauphine.fr/~cazenave/papers/solving.pdf pdf] » [[Breakthrough (Game)]], [[Proof-Number Search]]
 +
* [[Manuel Cristóbal López-Michelone]], [[Jorge Luis Ortega-Arjona]] ('''2016'''). ''[https://www.semanticscholar.org/paper/Patterns-for-the-game-of-chess-L%C3%B3pez-Michelone-Ortega-Arjona/3b7d115e187dbefc55f0979ba87908b6fe421ecc Patterns for the game of chess]''. SugarLoaf PLoP'16
 +
==2020 ...==
 +
* [[Manuel Cristóbal López-Michelone]], [[Jorge Luis Ortega-Arjona]] ('''2020'''). ''A description language for chess''. [[ICGA Journal#42_1|ICGA Journal, Vol. 42, No. 1]]
  
 
=Forum Posts=
 
=Forum Posts=
Line 116: Line 121:
 
* [https://www.stmintz.com/ccc/index.php?id=356967 Symbolic: First pattern instance generation] by [[Steven Edwards]], [[CCC]], March 27, 2004
 
* [https://www.stmintz.com/ccc/index.php?id=356967 Symbolic: First pattern instance generation] by [[Steven Edwards]], [[CCC]], March 27, 2004
 
* [https://www.stmintz.com/ccc/index.php?id=357145 Symbolic: Demo: a few more bootstrap patterns] by [[Steven Edwards]], [[CCC]], March 29, 2004
 
* [https://www.stmintz.com/ccc/index.php?id=357145 Symbolic: Demo: a few more bootstrap patterns] by [[Steven Edwards]], [[CCC]], March 29, 2004
 +
* [http://www.talkchess.com/forum/viewtopic.php?t=47250 positional patterns for "human" engine] by [[Pawel Koziol]], [[CCC]], February 16, 2013
  
 
=External Links=  
 
=External Links=  

Latest revision as of 14:37, 17 July 2020

Home * Knowledge * Pattern Recognition

Chess pattern [1]

Pattern Recognition,
is used to assign a label to an input value [2] , for instance to apply classification in machine learning applications, i.e. to identify objects and images, as well as computer chess related pattern of chess positions in Cognitive Psychology and concerning evaluation and control of the search in computer chess. Pattern recognition algorithms generally aim to provide a reasonable answer for all possible inputs and to perform a "fuzzy" matching. In contrast, Pattern matching usually has to be exact.

Chess Pattern

Chess pattern range from simple properties of squares and pieces concerning occupancy and control, to a more complex interrelated sets of features. Recognizers are implemented with decision trees, neural networks, and fuzzy logics. In his ICCA Journal paper Fuzzy Production Rules in Chess, Peter W. Frey [3] proposed feature strings or sets of three types. Type-A features must match completely, type-B feature strings represent features which are usually but not always present, while type-C features are present occasionally but are highly diagnostic when available. Those features were intended to use at the root for an oracle approach.

Chess Programs

See also

Publications

1950 ...

1960 ...

1970 ...

1980 ...

Revised as Hans Berliner, Carl Ebeling (1990). Hitech. Computers, Chess, and Cognition

1990 ...

2000 ...

2010 ...

2020 ...

Forum Posts

External Links

Hans Ulrik, Makiko Hirabayashi, Klavs Hovman, Marilyn Mazur

References

Up one Level