Anonymous user
Chess player/Move generation: Difference between revisions
THIS PAGE IS FLAGGED FOR DELETION ON or after 5 MAR 2020.
(Initial version of Move Generation sub-task page) |
(THIS PAGE IS FLAGGED FOR DELETION ON or after 5 MAR 2020.) |
||
| (4 intermediate revisions by 2 users not shown) | |||
Line 1:
<strike><nowiki>{{draft task|Move generation}}</nowiki></strike> This is a sub-task of the Chess player task.
;THIS PAGE IS FLAGGED FOR DELETION ON or after 5 MAR 2020.
Using suitable data structures, generate a list of valid moves given a chess game position and the side-to-move. You can create a basic (and incomplete) solution or create an advanced solution which covers all possible moves and depends on tracking more of the game state.
Line 5 ⟶ 7:
Basic implementation:
#Moves based on piece type
#Promotion to queen
#Allow resignation
More advanced/full implementation:
Line 14 ⟶ 16:
#Draw by repetition and 50-move rule
| |||