https://github.com/masterodin/connect4

One player connect-4 game through matlab using minimax w/ alpha-beta pruning algorithm.
https://github.com/masterodin/connect4

Last synced: 27 days ago
JSON representation

One player connect-4 game through matlab using minimax w/ alpha-beta pruning algorithm.

• Host: GitHub
• URL: https://github.com/masterodin/connect4
• Owner: MasterOdin
• Created: 2013-04-07T20:36:48.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2014-03-17T06:08:14.000Z (over 10 years ago)
• Last Synced: 2024-05-01T12:16:19.873Z (6 months ago)
• Language: Matlab
• Size: 137 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# connect4

## About

One player connect-4 game run through matlab using minimax w/ alpha-beta pruning algorithm.

Algorithm takes into account number of connect n-out-of-4 (0 > n > 4) with no opposing pieces in the line. Weighs the n with 1 point for 1, 50 for 2, and 100 for 3.

Written for CSC 380 (Spring 2013)

## Continuations

+ See if best algorithm isn't exactly zero-sum (favor minimizing over maximizing to block player always)

+ See if changing the weight for the n values affects AI decisions. Mainly curious to lower value for 2-out-of-4 to better AI defenses  

+ Find best mix of runtime per move and number of moves to look ahead. Currently set at 4 and easy to outthink AI and force a win  

+ Update basic logic for finding row/col in computermove.m. Might yield some speed improvement in reduced for loops

## Thanks

[Edward Kim](http://www.edwardkim.net/) provided skeleton code for project giving code for:  

click.m  

addpiece.m  

addpeice_noanim.m  

check4win.m  

checkplayer.m  

playconnect4.m