double test2() {
int p0 = 1;
int p1 = 3;
int p2 = 5;
int p3 = 5;
BishopMove * obj = new BishopMove();
clock_t start = clock();
int my_answer = obj->howManyMoves(p0, p1, p2, p3);
clock_t end = clock();
delete obj;
cout <<"Time: " <<(double)(end-start)/CLOCKS_PER_SEC <<" seconds" <<endl;
int p4 = 2;
cout <<"Desired answer: " <<endl;
cout <<"\t" << p4 <<endl;
cout <<"Your answer: " <<endl;
cout <<"\t" << my_answer <<endl;
if (p4 != my_answer) {
cout <<"DOESN'T MATCH!!!!" <<endl <<endl;
return -1;
}
else {
cout <<"Match :-)" <<endl <<endl;
return (double)(end-start)/CLOCKS_PER_SEC;
}
}
int main()
{
BishopMove bm;
int result[4] = {1, 0, 2, -1};
int runtest[4] = {
bm.howManyMoves(4, 6, 7, 3),
bm.howManyMoves(2, 5, 2, 5),
bm.howManyMoves(1, 3, 5, 5),
bm.howManyMoves(4, 6, 7, 4)};
for(int i = 0; i < 4; ++i)
{
cout << (result[i] == runtest[i] ? "pass" : "fail") << endl;
}
return 0;
}
