Changes

A '''Move List''' is a data structure inside a chess program with the aim to collect, administrate and process [[Moves|moves]] played during a [[Chess Game|game of chess]] or inside the [[Search|search]]. There are essentially two types of move lists. One type has alternating White and Black half-moves for [[Game Notation|game notation]] to record the game, continued by the current path or variation of the search. Same applies for the [[Principal variationVariation|principal variation]] as a result of a [[Depth-First|depth-first]] [[Minimax|minimax]] search. Secondly, a move list refers a list of [[Move Generation|generated moves]] for the [[Side to move|side to move]] of a [[Chess Position|position]], a [[Node|node]] of the [[Search Tree|search tree]] keeping the edges to its child-nodes to traverse. Move lists are often conveniently and efficiently implemented as pre-allocated [[Array|arrays]] rather than [[Linked List|linked]] or [[Linked List#Doubly|doubly linked lists]].