Math Is Fun Forum

Look at this game playing medium style:

1: e4  Nf6
2: Nc3  Nc6
3: f4  d6
4: Nf3  Bd7
5: Bb5  Nxe4
6: Nxe4  d5
7: Nc5  b6
8: Nxd7  a6
9: Bxc6  Rc8
10: Nf6

Why did it give me a free piece at move 5 with Nxe4?

Also when I checkmated it with a double check it didnt record the final move as Nf6++ or even Nf6+ indicating im checking him with knight and bishop.

Why didnt it help you? Its perfectly clear. I think the problem lies on the other side of the screen.

I do not follow that approach since I havent been introduced to double integrals yet.

Could you please add different levels of difficulty?

Look at this game in pgn-viewer:

1: e4  Nc6
2: f4  Nf6
3: Nc3  d6
4: Nf3  Be6
5: d4  h5
6: d5  Nxd5
7: exd5  Bxd5
8: Qxd5  Nb4
9: Qb5+  c6
10: Qxb4  c5
11: Bb5+  Qd7
12: Bxd7+  Kxd7
13: Qxb7+  Ke8
14: Nb5  Rd8
15: Qc6+  Rd7
16: Qc8+  Rd8
17: Nc7++

in move 5-6 it let me fork one of his pieces but instead of losing just that one, it ate with the knight which ended up losing 2 pieces. It went and gave me another piece later on.

Also, when a move gives checkmate, such as in my example "17: Nc7+" it is written with 2 plus signs. like "17: Nc7++"

Didnt we already help you with that?

Thanks Franklin for fixing my code. It would have given an out of bound error.

Let A = {1,2,3,4,5} and let B = {1,2,3} and let C = {1,2}

the numbers inside the { } denote the elements contained in the set separated by commas.

Here B is a subset of A and C is a subset of B but since B is a subset of A then any subsets of B will logically be a subset of A as well.

this is called Set Theory and its not hard to understand. If you want to understand it better you might want to read on it. Post if you have any questions.

I think its really funny how we all ignored Jane's explosion on what I thought was a plausible mistake by mathsy...

Also for your original question.

Lets say you have an array of size n which contains integers and you want to see which element inside the array is the largest number.

------------------------------------------------------------

int max_num(int []array) {
int largest_n = array[0];

for (int i=0; i<array.length(), i++) {
     if (array[i+1] > array[i])
         largest_n = array[i+1];
}

return largest_n;
}

------------------------------------------------------------

Im rusty on my java/C++ so dont focus on the syntax.

This code assumes the first element in the array is the largest number and then loops through all the elements checking to see if the next one is larger than the previous, if it is then we assume it is the largest one and continue. When the iteration throughout all the elements in the array is done then largest_n will contain the largest number in the array.

145 + ((72 + 5/2) / 100) is not equal to 145725.

Are you talking about concatenation or regular mathematical addition?

Ahhh yes. Your a genius!

Thanks.

Thanks a lot.