Difference between revisions of "Connect Four"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=Motivation= | =Motivation= | ||
| − | [https://en.wikipedia.org/wiki/Minimax Minimax] is an important | + | [https://en.wikipedia.org/wiki/Minimax Minimax] is an important concept in [https://en.wikipedia.org/wiki/Game_theory game theory] and search. |
[https://en.wikipedia.org/wiki/Negamax Negamax] is a variant which relies on <math>\max(a, b) = -\min(-a, -b)</math> | [https://en.wikipedia.org/wiki/Negamax Negamax] is a variant which relies on <math>\max(a, b) = -\min(-a, -b)</math> | ||
Revision as of 02:50, 29 March 2018
Contents
Motivation
Minimax is an important concept in game theory and search.
Negamax is a variant which relies on
While this technique is applicable to Chess (as Deep Blue employed to defeat Kasparov, we choose Connect Four as our context since it has a simpler game mechanic.
While the core part of searches like Minimax may be easy to parallelize, critical aspects of alpha-beta pruning are more challenging.
Background
Code To Implement
Testing Your Solution
Visualization
| class: | ConnectFourVizApp.java | VIZ |
| package: | connnectfour.challenge | |
| source folder: | student/src//java |
Correctness
| class: | ConnectFourTestSuite.java |  |
| package: | connnectfour.challenge | |
| source folder: | testing/src/test/java |
