search

oggy22 / BoardGames

A simple engine and end-tables for board games like chess, checkers and general tic-tac-toe (m,n,k-game) including connect 4. Heavy use of new C++ features like generator and concepts. Easy to add new engine and new game.
Apache License 2.0
0 stars 0 forks source link

Killer move heuristic for minmax #2

Open oggy22 opened 9 months ago

oggy22 commented 9 months ago

Depends on #1

oggy22 commented 2 days ago

There are couple of possibilities against few questions:

  1. Whether to keep a single or multiple moves for each depth?
  2. When to update the moves?
  3. Should the killer move be offered only once?
  4. If multiple moves kept what data structure should store them?

The possibilities are:

  1. Keep a single killer move for each depth
    • If it's not legal, keep the same move
    • If it's not legal, always update it to the current legal
  2. Keep a set of killer moves for each depth
    • If none of them is legal, add the current legal one