Mariyam Posted March 18, 2011 Posted March 18, 2011 all thts fine' date=' but I'd like to remind you that I was a pawn up when you chickened out.:P[/quote'] You lost both the games that we played real time. And that last game (correspondence) you won because I didn't log in for a day and was timed out. Is that how you like to win?
Late Cut Posted March 18, 2011 Posted March 18, 2011 Huh? Yo Herr Freud, I've beaten you in 100% of the games we've played. Your trash talking is as bad as your chess. :P But I'm interested, what is my psyche? How do I think? Sicilian or Tamilian, I don't know the terms, but I agree. 10Dulkar is a very good player. Ya mean the one game we played where i kept getting disconnected? :P As for my trash talking, it is only as good or bad as your lawyering. :--D Your psyche, hmmm...very intelligent, strong basics, yet impetuous and prone to be distracted, lacks patience and can be frustrated without immediate results...easily bored, a bit of a cynic, however, a closet romantic...there is more, or i might be misleading you.
DomainK Posted March 18, 2011 Posted March 18, 2011 The game of chess has been disgraced since Mariyam has denounced it.
vaibhav_delhi Posted March 19, 2011 Posted March 19, 2011 You lost both the games that we played real time. And that last game (correspondence) you won because I didn't log in for a day and was timed out. Is that how you like to win? sure you won... my post was just an attempt to bring you back to the tourny...:)
DomainK Posted March 19, 2011 Posted March 19, 2011 What is happening to the tourney? Is everyone taking sannyas from chess like Mariyam?:headshake:
Mariyam Posted March 19, 2011 Posted March 19, 2011 Since this tournament is on an indefinite strike, here is a problem for you guys to keep your brain cells active- Arrange 8 vazirs on a chess board such that no 2 vazirs kill each other. When you solve it, please don't submit your answer in the form of a0,b6 etc. Just take a pic of the chess board and post it here. First person to post the right answer gets 10,000 ICF $$ :icflove:
DomainK Posted March 19, 2011 Posted March 19, 2011 Since this tournament is on an indefinite strike, here is a problem for you guys to keep your brain cells active- Arrange 8 vazirs on a chess board such that no 2 vazirs kill each other. When you solve it, please don't submit your answer in the form of a0,b6 etc. Just take a pic of the chess board and post it here. First person to post the right answer gets 10,000 ICF $$ :icflove:
vaibhav_delhi Posted March 19, 2011 Posted March 19, 2011 player1 plays player 2 [table=head;sort=3]S.No| Player1| Player2 1|Bossbhai| Jadoo 6|Gaurav92|Mariyam 4|Bumblebee|Domaink 5|Jusarrived|Dravid 7|Cricketics|Vaibhav_delhi 3|IKnowU| late cut 2|Sangrock| Zelig 8|10Dulkar|b555 [/table] Jusarrived, Mariyam, 10dulkar have won. Bossbhai, latecut, DomainK(??), SangRock, Vaibhav_delhi have been given a bye. We could have the quarters if folks are interested....
Mariyam Posted March 19, 2011 Posted March 19, 2011 Correct :hatsoff: That was quite fast. It took me a very loooooooong time to solve this. Ladies and Gentlemen, I present DomainK, the Chuppa Rustam . :band: While we're all bragging about our shatranj prowess, DK is silently moving in for the kill. Ok, another one.. arrange 32 horses on the chess board such any horse doesn't kill any other horse. No ICF $$ for this one.
DomainK Posted March 19, 2011 Posted March 19, 2011 Correct :hatsoff: That was quite fast. It took me a very loooooooong time to solve this. Ladies and Gentlemen, I present DomainK, the Chuppa Rustam . :band: While we're all bragging about our shatranj prowess, DK is silently moving in for the kill. Ok, another one.. arrange 32 horses on the chess board such any horse doesn't kill any other horse. No ICF $$ for this one. The eight queens one was not new to me. Someone had given me the puzzle long back and I had solved it. So it was not very difficult reproducing the result. However, the 32 horses one was new to me, but turned out quite simple in the end. Took a few secondsto figure it out.
Mariyam Posted March 19, 2011 Posted March 19, 2011 The eight queens one was not new to me. Someone had given me the puzzle long back and I had solved it. So it was not very difficult reproducing the result. However, the 32 horses one was new to me, but turned out quite simple in the end. Took a few secondsto figure it out. Correct again. Taaliyan. :hatsoff:
EnterTheVoid Posted April 1, 2011 Posted April 1, 2011 b55, being the chess/maths buff you are, something for you: The N - Queens Problem The problem goes like this: Arrange N Queens on a chess board such that no two queens attack each other. Story goes, this problem has been there for as long as the game of chess himself, even Gauss had a crack at it. Heres another thing: Apparently, this problem is quite a favorite when it comes to aptitude tests and in interviews for software development. They get you to write the pseudocode for it :((
EnterTheVoid Posted April 1, 2011 Posted April 1, 2011 I am trying to write the code for the N - Queens problem in C/C++ and I can tell you, its ****ing hard. ****ing confusing too :wall:
Mariyam Posted April 6, 2011 Posted April 6, 2011 b55, being the chess/maths buff you are, something for you: The N - Queens Problem The problem goes like this: Arrange N Queens on a chess board such that no two queens attack each other. Story goes, this problem has been there for as long as the game of chess himself, even Gauss had a crack at it. Heres another thing: Apparently, this problem is quite a favorite when it comes to aptitude tests and in interviews for software development. They get you to write the pseudocode for it :(( I'm DK solved this problem on the last page. Is that incorrect? What do you mean by N queens?
EnterTheVoid Posted April 6, 2011 Posted April 6, 2011 On a typical chess board, N = 8 (8 Rows and 8 Columns) So, on a N (8) x N (8) chess board, find a way of placing N (8) queens such that no two attack each other. If N = 3, find a way of placing N (3) queens on a board that has N (3) rows and N (3) columns. This problem is sometimes asked in interviews because it uses a method called "back tracking", a big deal in Artificial Intelligence.
Mariyam Posted April 6, 2011 Posted April 6, 2011 On a typical chess board, N = 8 (8 Rows and 8 Columns) So, on a N (8) x N (8) chess board, find a way of placing N (8) queens such that no two attack each other. If N = 3, find a way of placing N (3) queens on a board that has N (3) rows and N (3) columns. This problem is sometimes asked in interviews because it uses a method called "back tracking", a big deal in Artificial Intelligence. Trick question? For n = 8, DomainK has already solved it and even posted a pic of his solution on the previous page of this very thread. You can check it. But for n=2, its is 2x2 board. Only 4 squares. So you place the Wazir on any of the squares, it can capture all the other squares. There is no way you can place another wazir (thats what its called, not queen :D )on a 2x2. It untrue for n =2. Obviously it is not applicable for all n. Right? Am I wrong? Or am I missing something? Does this mean that I can do without artificial intelligence? :P
EnterTheVoid Posted April 6, 2011 Posted April 6, 2011 You're correct in saying the problem doesn't work for N = 2 (and 3). For n = 4, 5, 6, 7 and 8, its fairly straight forward to find a solution. The following is a screen shot of the computer output for the N Queens algorithm for N = 8. It doesn't just find one solution where 8 queens can be placed on a 8 x 8 chessboard but all solutions. 1 designates the presence of a queen while 0 designates its absence.
Recommended Posts