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

▶
connect four
SMART_READER_LITE
LIVE PREVIEW

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

Jan 19, 2023 612 likes •715 views

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

slide-1
SLIDE 1

Connect Four

by Jacob Frericks

slide-2
SLIDE 2

Rules

slide-3
SLIDE 3

Snapshot

slide-4
SLIDE 4

Algorithms: Random

  • Randomly chooses a column to place the piece

Advantages

  • Time complexity ( O(1) )

Disadvantages

  • Loses nearly 100% of the time
slide-5
SLIDE 5

Algorithms: MiniMax

  • Minimizes the possible loss for the worst case

Advantages

  • Situation based (heuristic)

Disadvantages

  • Time complexity ( O(branchF^depth) )
slide-6
SLIDE 6

MiniMax

Reduce time complexity

  • Cap the depth
  • different depth = different levels

Heavily dependent on its heuristic

slide-7
SLIDE 7

Future Improvements

Heuristic

  • Defensive
  • Only check opponents pieces
  • Aggressive
  • Never check opponents pieces
  • Combination (Blocker)
  • Block opponent's 4th piece, otherwise be aggressive
slide-8
SLIDE 8

Future Improvements

GUI

  • Make one

Alpha-Beta pruning

  • Decrease time complexity
slide-9
SLIDE 9
  • Questions?