![]() |
Man vs. Machine: It's ON
Fox is missing the boat pitting a bunch of little people against and elephant and a zebra racing "cheetah man".
They should have found a way to factor in Gary Kasparov in the big Chess rematch against Deep Junior: http://www.msnbc.com/news/863920.asp |
haha,,chess boring
|
It'll be interesting to see what happens. Most people think Kasparov lost to Deep Blue because he played weird, strategic openings he was unfamiliar with in an attempt to stay away from positions in which the computer could benefit from its enormous advantage in deep calculation. Chess computers can't make abstract strategic considerations, they can only calculate.
Hopefully he won't make the same mistakes again. He also better not cry like a baby if he loses. |
playa - I'll grant you that watching chess is sort of like watching tennis, unless you watch brilliant players playing chess like Kasparov or hot looking tennis players like anna kournikova (who seemed to have little talent beyond her looks).
For those who are interested, x3dworld is running an internet broadcast on it starting Sun at 3:30pm Eastern Time. Check their website for details. gutterboy - I'm thinking that Kasparov will probably try to play on that abstract weakness in Deep Junior, although according to Deep Junior programmers, there is "new era where programs understand more abstract concepts in chess" And then there's this: "Kasparov noted that the computer always has a huge advantage over a human player: it never makes mistakes, it never gets tired, it never gets demoralized. Of course, with one caveat, "It does care about power failure!" |
It is a losing battle as Chess is finite so at some point it is solvable. With that being said, "GO GARY!!"
|
Quote:
That said, if Deep Junior is really better than Deep Blue, I think Kasparov is going to get spanked, again, and he'll either commit suicide or spend the next six years whining like he did the last six. I hope he wins, though. SpaceAce |
Quote:
As for chess being finite... there are approx. 10,000,000,000,000,000,000,000,000,000,000,000,000 ,000,000 possible chess positions. The best chess computers can evaluate 50,000 moves per second, or only 4.5 billion moves per day. There will have to be a quantum leap in computing power before solving it is thinkable. There is supposedly a mathematic proof somewhere showing that despite being finite, chess is unsolvable. Don't ask me how or where tho. |
kasparov won match #1 of 7. He played with his usual aggressive opening style and Deep Junior got stymied at move 9 taking more than 25 minutes to calculate its next move. After 27 moves, Junior resigned. Next match is on Tuesday!
|
i love machines.
knobs, sliders, and LFOs oh my. |
|
When Deep Blue will be "pissed" because it's lost a game, I will be worried, until then ... :sleep
|
http://www.extremetech.com/article2/...,873874,00.asp
The draw ends the first FIDE Man Vs. Machine Championship, with Kasparov being paid a $500,000 appearance fee and an additional $175,000 of the $300,000 total prixe money. Nice |
| All times are GMT -7. The time now is 01:44 PM. |
Powered by vBulletin® Version 3.8.8
Copyright ©2000 - 2025, vBulletin Solutions, Inc.
©2000-, AI Media Network Inc123