• Solving Connect 4: how to build a perfect AI
  • About
  • Connect Four Solver
    Pascal Pons

    Pascal Pons

    • Email
    • LinkedIn
    • Github
    • Solving Connect Four
      • 1. Introduction
      • 2. Test protocol
      • 3. MinMax algorithm
      • 4. Alpha-beta algorithm
      • 5. Move exploration order
      • 6. Bitboard
      • 7. Transposition table
      • 8. Iterative deepening
      • 9. Anticipate losing moves
      • 10. Better move ordering
      • 11. Optimized transposition table
      • 12. Lower bound transposition table

    about

    about

    Share on

    Twitter Facebook Google+ LinkedIn
    • Follow:
    • GitHub
    • Feed
    © 2019 Pascal Pons. Powered by Jekyll & Minimal Mistakes.