https://github.com/tyler-hilbert/connect4combinatorics

Calculates the total number of unique Connect 4 games
https://github.com/tyler-hilbert/connect4combinatorics

Last synced: about 14 hours ago
JSON representation

Calculates the total number of unique Connect 4 games

• Host: GitHub
• URL: https://github.com/tyler-hilbert/connect4combinatorics
• Owner: Tyler-Hilbert
• Created: 2020-04-07T09:56:45.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2023-11-15T21:12:26.000Z (12 months ago)
• Last Synced: 2023-11-15T22:29:05.023Z (12 months ago)
• Language: C++
• Homepage:
• Size: 4.88 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Connect 4 Combinatorics  

Calculates the number of unique connect 4 games that can be played.  

A game is considered unique by the order that the moves are made. This means that multiple unique games can result in the same board state if a different order of moves was made to get there.  

# How it works

This program uses a DFS to explore every possible unique game. The number of unique games will be equal to the number of leaf nodes in the DFS search tree.  

# Results

It was determined that the board size of Connect 4 is too large to do a complete DFS over.  

Various ways to decrease the search tree were investigated. It was determined that even when using symmetry to reduce the tree size the computation time was still too large to complete.