Last active
September 9, 2018 23:56
-
-
Save dschinkel/9e7d025225b0d8d70976dde4ab28a2f1 to your computer and use it in GitHub Desktop.
miniMax Algorithm in Elm - Tests - next move wins for a column - Attempt 1 - Test Only
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| it "next move wins for a column" <| | |
| let | |
| gameNode = | |
| [ markerX, empty, empty, markerX, empty, empty, empty, empty, empty ] | |
| cellSevenIndex = | |
| 6 | |
| nextMove = | |
| Scorer.nextBestMove gameNode | |
| in | |
| expect nextMove to equal cellSevenIndex |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment