| Module Name: MakeMove | Project: Training |
| Author: --- | Tester: Seth Marinello |
| Date: -- | Test Date: 2/20/05 |
Cyclomatic Complexity Computation (# Edges - # Nodes + 2):
13-10+2 = 5
| Path (E.g. 1-3-4-13-14) |
Test Case Matrix | |||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
| 1-2 | X | |||||||||
| 1-3-4-6-7-8-9-10 | X | |||||||||
| 1-3-5-6-7-8-9-10 | X | |||||||||
| 1-3-4-6-8-9-10 | X | |||||||||
| 1-3-5-6-8-9-10 | X | |||||||||
| Case # | Input Values | Expected Outcomes |
| 1 | (1,5,5) - (1,6,6) | FALSE |
| 2 | player1's turn and not first move (4,5,7) | TRUE |
| 3 | player2's turn and not first move (2,8,9) | TRUE |
| 4 | player1's turn and first move (5,5,5) | TRUE |
| 5 | player2's turn and first move (5,6,7) | TRUE |
| 6 | ||
| 7 | ||
| 8 | ||
| 9 |