Fun at zangOOr Click Here
0 like 1 dislike
187 views
Imagine you are playing a new version of the game of chess, called Pravega chess. the rules are same, with just one exception. You have to play 2k moves at a time, where k is any natural number. Prove that, black who plays second always has a non-losing strategy.
in Science & Mathematics by (-10 points) | 187 views
0 0
i donno hw to solve this. it is claimed the toughest qs

1 Answer

0 like 0 dislike
I am sure that this cannot be proven correct..
by (790 points)
0 0
every qs has an answer bro...u dont know that

Related questions

0 like 1 dislike
0 answers
asked Mar 3, 2014 in Science & Mathematics by subrata mondal (-30 points) | 86 views
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
1 answer
0 like 0 dislike
0 answers
1 like 0 dislike
1 answer
0 like 0 dislike
0 answers

Where your donation goes
Technology: We will utilize your donation for development, server maintenance and bandwidth management, etc for our site.

Employee and Projects: We have only 15 employees. They are involved in a wide sort of project works. Your valuable donation will definitely boost their work efficiency.

How can I earn points?
Awarded a Best Answer 10 points
Answer questions 10 points
Asking Question -20 points

1,245 questions
1,400 answers
565 comments
4,809 users