Everything About ___
Live briefing

Everything about Move generation

Algorithmic determination of legal moves in a strategy game engine

Move generation is the computational process by which a program identifies the legal moves available from a given game state in computer chess and generally other strategy games. In general game playing, the engine must produce only valid moves before evaluation can begin. Pseudo-legal moves follow basic movement rules, and fully legal moves satisfy all higher-level constraints such as check (chess). Because the number of possible positions grow exponentially with search depth, move generation has a major effect on speed and search. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Move generationA 5-minute orientation
  2. Skim a recent paper: Generation of Novelty Ground Truth Image Using Image Classification and Semantic Segmentation for Copy-Move Forgery DetectionInfluential work since 2022
  3. Pick up a classic book: The Professor's HouseThe most-reprinted book on the subject
  4. Read the landmark paper: Making the first move in EGFR-driven or ALK-driven NSCLC: first-generation or next-generation TKI?Cited 283 times
  5. Go sideways: BitboardA closely related topic
  6. Go sideways: Board representation (computer chess)A closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics