https://github.com/defgsus/ttt

TicTacToe With Capturing - engine
https://github.com/defgsus/ttt

Last synced: 28 days ago
JSON representation

TicTacToe With Capturing - engine

• Host: GitHub
• URL: https://github.com/defgsus/ttt
• Owner: defgsus
• Created: 2014-03-22T09:11:28.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2014-04-07T01:40:05.000Z (over 10 years ago)
• Last Synced: 2024-10-10T15:31:19.238Z (about 1 month ago)
• Language: C++
• Size: 402 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
X in a row in N^2 - with capturing - engine

This is a little project to learn about minimax and alpha-beta pruning.

Properties:

 - runs as interactive console app

 - runs in parallel, splitting at root nodes

 - optional greedy cut-off strategy 

 - includes Qt project (and uses the QTime object)

 - allows arbitrary board and row sizes 

 - allows capturing, e.g. XOO. -> XOOX -> X..X

DISCLAIMER:

The Engine plays okay i think - still quite slow (1-5 million nodes-per-sec on ubu64/i7).

Sometimes (with search depth >= 6 or so), the opponent will do some stupid stuff instead of breaking your winning row. This is because it already knows it has lost and tries to get at least a better evaluation value at the end ;)

TODO:

 - Hash seems not be working correctly

 - alpha/beta is recorded only from level 1 instead of level 0. (To avoid thread synchronization)  

 - Need time limit for moves...