/chess - Work In Progress

My GitHub Commit Snake

Commit Snake
Your turn

Current Bot Version:

Information Panel for Chess Bot Versions

Chess Bot Version 0.0

Key Feature: Random Moves

Features Implemented:

  • None, just random moves XD

Average Decision Time: 0 seconds

Estimated Time Complexity: O(1)

Noticeable Weakness:

  • Absolutely no strategies involved

Chess Bot Version 1.0

Key Feature: Minimax Algorithm [Depth 2]

Features Implemented:

  • Uses basic depth-limited decision-making algorithm evaluated by maximizing player pieces and minimizing opponent pieces

Average Decision Time: ??? seconds

Estimated Time Complexity: O(b^d), where b is the branching factor and d is the depth

Noticeable Weakness:

  • Takes a long time to make decisions, which exponentially increases with each depth level
  • If depth is not high enough, it may make suboptimal/bad moves
  • Does not employ logical strategies, only focuses on maximizing piece count

Chess Bot Version 1.1

Key Feature: [DISCONTINUED] Minimax Algorithm with Alpha-Beta Pruning [Depth 3]

Features Implemented:

  • Uses depth-limited decision-making algorithm with alpha-beta pruning for faster decision-making
  • Avoids exploring branches that won't affect the final decision

Average Decision Time: ??? seconds

Estimated Time Complexity: Ω(b^(d/2)), ϴ(b^(3d/4)), O(b^d), where b is the branching factor and d is the depth

Noticeable Weakness:

  • Potentially faster than Version 1.0, equally fast despite higher depth limit in some scenarios
  • Certain scenario (mainly positions where trading pieces are viable) results in close to Worst Time Complexity [Long duration]
  • Does not employ logical strategies, only focuses on maximizing piece count

Chess Bot Version 1.2

Key Feature: Minimax Algorithm with Alpha-Beta Pruning and Move Ordering [Depth 3]

Features Implemented:

  • Uses depth-limited decision-making algorithm with alpha-beta pruning for faster decision-making
  • Avoids exploring branches that won't affect the final decision
  • Employs move ordering to prioritize more promising moves (Specifically captures and checks)

Average Decision Time: ??? seconds

Estimated Time Complexity: ???

Noticeable Weakness:

  • More consistent in faster decision-making compared to Version 1.1, despite similar depth limit
  • Does not employ logical strategies, only focuses on maximizing piece count