Difference between revisions of "Moves"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| Line 73: | Line 73: | ||
* [[Alex Bell]], [http://www.springerlink.com/content/?Author=N.+Jacobi N. Jacobi] ('''1979'''). ''[http://comjnl.oxfordjournals.org/content/22/1/71.abstract How to read, make and store chess moves]''. [http://comjnl.oxfordjournals.org/content/22/1.toc The Computer Journal Vol. 22, No. 1], 71-75 | * [[Alex Bell]], [http://www.springerlink.com/content/?Author=N.+Jacobi N. Jacobi] ('''1979'''). ''[http://comjnl.oxfordjournals.org/content/22/1/71.abstract How to read, make and store chess moves]''. [http://comjnl.oxfordjournals.org/content/22/1.toc The Computer Journal Vol. 22, No. 1], 71-75 | ||
* [[Barak Oshri]], [[Nishith Khandwala]] ('''2015'''). ''Predicting Moves in Chess using Convolutional Neural Networks''. [http://cs231n.stanford.edu/reports/ConvChess.pdf pdf] <ref>[https://github.com/BarakOshri/ConvChess GitHub - BarakOshri/ConvChess: Predicting Moves in Chess Using Convolutional Neural Networks]</ref> » [[Deep Learning]], [[Neural Networks]] | * [[Barak Oshri]], [[Nishith Khandwala]] ('''2015'''). ''Predicting Moves in Chess using Convolutional Neural Networks''. [http://cs231n.stanford.edu/reports/ConvChess.pdf pdf] <ref>[https://github.com/BarakOshri/ConvChess GitHub - BarakOshri/ConvChess: Predicting Moves in Chess Using Convolutional Neural Networks]</ref> » [[Deep Learning]], [[Neural Networks]] | ||
| + | |||
| + | =Forum Posts= | ||
| + | * [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74140 Game-terminating moves (variant stuff)] by [[Harm Geert Muller]], [[CCC]], June 09, 2020 » [[Games]] | ||
=External Links= | =External Links= | ||
Revision as of 10:42, 20 June 2020
In Chess terminology or game notation, a Move (or full move) implies a piece movement of both sides, white and black, e.g. 1. d4 Nf6. To relax this ambiguity, the term Half-move is used, also donated as one ply, to make sure that it is only the piece movement of one single side. However, in the context of chess programming, if not stated otherwise, the term Move refers the piece movement of one side, thus a half-move.
In the context of search, a Move is the edge, connecting two Nodes, which represent two consecutive chess positions inside one path of the search tree.
Contents
Type of Moves
Quiet Moves
Altering Material
- Captures
- En passant capture
- Promotions
- Piece Drop in various Chess variants
Tactical Properties
Reversibility
Involved Squares
Encoding and Generating
Notation
Adjunct Moves
Those moves are determined by search and are matter of move ordering:
- Best Move
- Hash Move
- Killer Move
- PV-Move
- Refutation Move
- Threat Move from null move refutations
Make and Unmake
See also
Publications
- Alex Bell, N. Jacobi (1979). How to read, make and store chess moves. The Computer Journal Vol. 22, No. 1, 71-75
- Barak Oshri, Nishith Khandwala (2015). Predicting Moves in Chess using Convolutional Neural Networks. pdf [2] » Deep Learning, Neural Networks
Forum Posts
- Game-terminating moves (variant stuff) by Harm Geert Muller, CCC, June 09, 2020 » Games
External Links
- Betza notation and XBoard » Chess Variants, XBoard
- NHØP & Joe Pass - Move, Jazzhus Slukefter, Tivoli, Copenhagen, 1982, YouTube Video
