Difference between revisions of "Connect Four"
Jump to navigation
Jump to search
(Created page with "=Motivation= [https://en.wikipedia.org/wiki/Minimax Minimax] is an important decision rule used in [https://en.wikipedia.org/wiki/Game_theory game theory]. [https://en.wikipe...") |
|||
| Line 4: | Line 4: | ||
[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> | ||
| − | While [https://en.wikipedia.org/wiki/ | + | While this technique is applicable to [https://en.wikipedia.org/wiki/Chess Chess] (as [https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer) Deep Blue] [https://en.wikipedia.org/wiki/Deep_Blue_versus_Garry_Kasparov employed to defeat Kasparov], we choose [https://en.wikipedia.org/wiki/Connect_Four 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. | While the core part of searches like Minimax may be easy to parallelize, critical aspects of alpha-beta pruning are more challenging. | ||
Revision as of 02:50, 29 March 2018
Contents
Motivation
Minimax is an important decision rule used in game theory.
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 |
