-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
96 lines (91 loc) · 3.6 KB
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include "Board.h"
#include "Game.h"
#include "Player.h"
#include "Side.h"
using namespace std;
#include <iostream>
int main(int argc, const char * argv[]) {
// cout << "HI" << endl;
Board b(6, 3);
BadPlayer bad("Bob");
HumanPlayer hp("Tristan");
Game g(b, &hp, &bad);
g.play();
return 0;
// BadPlayer bp1("Bart");
// BadPlayer bp2("Homer");
// Board b(3, 0);
// b.setBeans(SOUTH, 1, 2);
// b.setBeans(NORTH, 2, 1);
// b.setBeans(NORTH, 3, 2);
// Game g(b, &bp1, &bp2);
// bool over;
// bool hasWinner;
// Side winner;
// // Homer
// // 0 1 2
// // 0 0
// // 2 0 0
// // Bart
// g.status(over, hasWinner, winner);
// assert(!over && g.beans(NORTH, POT) == 0 && g.beans(SOUTH, POT) == 0 &&
// g.beans(NORTH, 1) == 0 && g.beans(NORTH, 2) == 1 && g.beans(NORTH, 3) == 2 &&
// g.beans(SOUTH, 1) == 2 && g.beans(SOUTH, 2) == 0 && g.beans(SOUTH, 3) == 0);
//
// g.move(SOUTH);
// // 0 1 0
// // 0 3
// // 0 1 0
// g.status(over, hasWinner, winner);
// assert(!over);
// assert(g.beans(NORTH, POT) == 0);
// assert(g.beans(SOUTH, POT) == 3);
//
// assert(g.beans(NORTH, 1) == 0 && g.beans(NORTH, 2) == 1 && g.beans(NORTH, 3) == 0 &&
// g.beans(SOUTH, 1) == 0 && g.beans(SOUTH, 2) == 1 && g.beans(SOUTH, 3) == 0);
//
// g.move(NORTH);
// // 1 0 0
// // 0 3
// // 0 1 0
// g.status(over, hasWinner, winner);
// assert(!over && g.beans(NORTH, POT) == 0 && g.beans(SOUTH, POT) == 3 &&
// g.beans(NORTH, 1) == 1 && g.beans(NORTH, 2) == 0 && g.beans(NORTH, 3) == 0 &&
// g.beans(SOUTH, 1) == 0 && g.beans(SOUTH, 2) == 1 && g.beans(SOUTH, 3) == 0);
//
// g.move(SOUTH);
// // 1 0 0
// // 0 3
// // 0 0 1
// g.status(over, hasWinner, winner);
// assert(!over && g.beans(NORTH, POT) == 0 && g.beans(SOUTH, POT) == 3 &&
// g.beans(NORTH, 1) == 1 && g.beans(NORTH, 2) == 0 && g.beans(NORTH, 3) == 0 &&
// g.beans(SOUTH, 1) == 0 && g.beans(SOUTH, 2) == 0 && g.beans(SOUTH, 3) == 1);
//
// g.move(NORTH);
// // 0 0 0
// // 1 4
// // 0 0 0
// g.status(over, hasWinner, winner);
// assert(over && g.beans(NORTH, POT) == 1 && g.beans(SOUTH, POT) == 4 &&
// g.beans(NORTH, 1) == 0 && g.beans(NORTH, 2) == 0 && g.beans(NORTH, 3) == 0 &&
// g.beans(SOUTH, 1) == 0 && g.beans(SOUTH, 2) == 0 && g.beans(SOUTH, 3) == 0);
// assert(hasWinner && winner == SOUTH);
// HumanPlayer hp("Marge");
// assert(hp.name() == "Marge" && hp.isInteractive());
// BadPlayer bp("Homer");
// assert(bp.name() == "Homer" && !bp.isInteractive());
// SmartPlayer sp("Lisa");
// assert(sp.name() == "Lisa" && !sp.isInteractive());
// Board b(3, 2);
// b.setBeans(SOUTH, 2, 0);
// cout << "=========" << endl;
// int n = hp.chooseMove(b, SOUTH);
// cout << "=========" << endl;
// assert(n == 1 || n == 3);
// n = bp.chooseMove(b, SOUTH);
// assert(n == 1 || n == 3);
// n = sp.chooseMove(b, SOUTH);
// assert(n == 1 || n == 3);
}
//