1 / 9

Connect Four

Connect Four. by Jacob Frericks. Rules. Snapshot. Algorithms: Random. Randomly chooses a column to place the piece Advantages Time complexity ( O(1) ) Disadvantages Loses nearly 100% of the time. Algorithms: MiniMax. Minimizes the possible loss for the worst case Advantages

seda
Download Presentation

Connect Four

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Connect Four by Jacob Frericks

  2. Rules

  3. Snapshot

  4. Algorithms: Random • Randomly chooses a column to place the piece Advantages • Time complexity ( O(1) ) Disadvantages • Loses nearly 100% of the time

  5. Algorithms: MiniMax • Minimizes the possible loss for the worst case Advantages • Situation based (heuristic) Disadvantages • Time complexity ( O(branchF^depth) )

  6. MiniMax Reduce time complexity • Cap the depth • different depth = different levels Heavily dependent on its heuristic

  7. Future Improvements Heuristic • Defensive • Only check opponents pieces • Aggressive • Never check opponents pieces • Combination (Blocker) • Block opponent's 4th piece, otherwise be aggressive

  8. Future Improvements GUI • Make one Alpha-Beta pruning • Decrease time complexity

  9. Questions?

More Related