connect four
play

Connect Four by Jacob Frericks Rules Snapshot Algorithms: Random - PowerPoint PPT Presentation

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


  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 o Heavily dependent on its heuristic

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

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

  9. � � � Questions?

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend