Nope!

From a Chess Computers Point of View!...it does not Need any Psychology when it can Calculate 100 % Accurate Check Mates in 30 + Moves! If it Needs to!

Does not need any psychology?! You make it sound like a choice. It cannot get any psychology or have any. The programmers have not figured out how to program that in. So, there is the secret of computer intelligence, humans!

No engine ever made or very likely in the future can search 30 moves ahead. 30 ply is not 30 moves ahead. 30 moves with the alpha beta algorithm and minimax examines only a small portion of the game tree. They do not have any more of an idea of what the right moves are than you do.

You would lose your House/Flat Car/Bicycle Dog/Cat/Mouse... and Everything else you own! If ever you made that Bet against any of the Worlds Top Chess Engines as of 2011 and Many Engines Before!.

Colorful but the results just do not back you up. Of course you can continue believing that for as long as you want.

When you Test Chess Engines...You Don't use Opening Books..You Don't use Endgame Data Base..You Don't test them at One Time Interval,Etc.

Wrong again! If you strip an engine of its opening book it can hardly get out of the opening without a lost position. Despite their supposed great look ahead they still do not know where the pawns and pieces belong. They rely on their massive books given to them by human programmers. Without those books frankly they are awful. You do not play much chess do you? And never against an engine obviously.

By the way you have answered none of my points. You keep coming back with statements that sound like a commercial. An advertisement about the new and improved engine that is better then the one 3 weeks ago. The fact that you think the encyclopedia brittanica has intelligence because it is stuffed full of facts that humans put in there is mystifying.

I know you will not get down here because you are not reading these posts. I must ask a question what is GiB?

You do not have to copy my entire post even the signature. You should at least put quotes around someone else's work.

All of the above....is So Unbelievably Funny that it Needs no Comment!

Maybe, you have no real comment...

Those are not the earliest machines? Have you heard of Sargon? CC7?

Did you know back then I used to beat Sargon and Chess Challenger 7 blindfolded? Yes, even I could play pretty good blindfold chess. The computers do not play significantly better than they did then. They are stronger no doubt because machines are faster but they do not play any better as far as positional understanding. They are weeeeeeeeeeakkkk!

The humans back then were the problem. There were too many better players.

Quote: bobbym “No engine ever made or very likely in the future can search 30 moves ahead.”


GiB.


Don't Know How many Times I have to Keep doing this!? Until the Penny Drops!


**********************************************************************************************************************

Longest Forced Check Mates/Conversions: So Far!?

3 Pieces:
KP-K, 28 moves DTM, 19 moves DTC.
4 Pieces:
KR-KN, 40 moves DTM [27 moves DTC].
KBN-K, 33 moves DTC&M
KQ-KR, 31 moves DTC (that is, capturing the rook)
KQ-KP, 27 moves DTC
5 Pieces:
KPP-KP, 127 moves DTM (turning into a KQP-KQ win in 122).
KQP-KQ, 124 moves DTM, 114 moves DTC.
KNN-KP, 115 moves DTM, 114 moves DTC, 82 moves DTZ (distance to zeroing - meaning an irreversible move, one that puts the OTB 50-move count back to zero; in this case a pawn move).
Other maximal wins of over 50 moves include (highlighted are the two most practical by far):
KQ-KRP, 79 moves DTC; KBN-KN, 76 moves DTC; KQ-KBB, 71 moves DTC; KBB-KN, 66 moves DTC; KQ-KNN, 63 moves DTC; KRB-KB, 62 moves DTC; KQR-KQ, 60 moves DTC; KRP-KR, 60 moves DTC; KRB-KR, 59 moves DTC.
6 Pieces:
KRN-KNN, 262 moves DTM, 243 moves DTC.
KRRP-KQ, 253 moves DTM.
(KRP-KNN and KRN-KNP of 253 and 252 moves DTM respectively are essentially of the record endgame type, with a N promotion on move 1 in both cases. Other 200+ setups also turn quickly into the one of the two above following promotions.)
KRB-KNN, 238 moves DTM, 223 moves DTC.
KRN-KBN, 209 moves DTM, 190 moves DTC.
KQPP-KQ, 182 moves DTM.
KBBP-KR, 180 moves DTM.
KQN-KRR, 174 moves DTM, 153 moves DTC.
7 Pieces:
KQN-KRBN, 517 moves DTC [+8 to mate] (Entry No.316)
KQBN-KQB (opp. color B), 330 moves DTC (Entry No.311)
KQBN-KQN, 317 moves DTC [+33 to mate] (Entry No.311)
KRRN-KRR, 290 moves DTC [+8 to mate] (Entry No.298)

Quote: bobbym “No engine ever made or very likely in the future can search 30 moves ahead.”

GiB.

When Using Table Bases the Computer still has to Search! + Moves Ahead! which Again is Opposite to your Quote above!
You could not Store or Search to 317 Moves as well as Many of the Other Searches Above.

To Prove the Point in Another Way!...

Deep Thought,1990,FENG-HSIUNG HSU, THOMAS ANANTHARAMAN, MURRAY CAMPBELL and ANDREAS NOWATZYK.

Speed is the key to work now under way at the IBM Thomas J. Watson Research Center, where the next-generation machine is now being designed. It should out calculate its predecessor by a factor of at least 1,000. The machine we have in mind will therefore examine more than a billion positions per second, enough to search 14 or 15 plies deep in most cases and from 30 to 60 plies in forcing lines.

GiB.

Deep Thought was Old Technology Compared to Deep Blue in 1997 and yet even Deep Thought could Search 30 to 60 plies in Forcing Lines ( 30 Moves ) So for Deep Blue to Search 30 + Moves would be no Problem!

It's No Good "bobbym" Your in a Corner and you can't get out of it! CHECK!

All my Quotes are Based on Calculation/Search of Some Kind!

I love the Way you Skip..." Deep Thought was Old Technology Compared to Deep Blue in 1997 and yet even Deep Thought could Search 30 to 60 plies in Forcing Lines ( 30 Moves ) So for Deep Blue to Search 30 + Moves would be no Problem! "

And Now CHECKMATE!!

GiB.

1994, Deep Thought 2 won the North American Computer Chess Championship for the fifth time, with its rating estimated at around 2600. It was sponsored by IBM. Some engineers who designed Deep Thought also worked in the design of Deep Thought 2. Its algorithms were quite simple evaluation functions, but it could examine half a billion chess positions per move in tournament games, which is sufficient to reach depth of 10 or 11 moves ahead in complex positions. Despite that, using the technique of singular extensions it could also follow lines of forced moves that reach even further, which is how it once found a checkmate in 37 moves.


comment removed - insulting, flaming.

Last edited by GeniusIsBack (2011-01-26 00:40:24)

can somebody explain to me what the argument is here ? are you talking about the end of the earth or about chess ?

if you are talking about if a computer or a human is better..

what do you mean by better?

if a computer play the best players in the world and win every time, then that mean it can win all the time.

but what a human can do that a computer cant i would say is make up new defences, attacking methods, etc, a computer cant (usually) do this. a human has the creative mind

also the world will end if and only if the world doesn't end  tomorrow

Hi phrontister;

I noticed in the 10 min blitz he lost to Rybka 4  4 - 2.

I know those engines well. Houdini is a fast tactician but I think Rybka 4 plays better especially against me.

Hi phrontister

I used to have a Novag Constelation 3.6 and Thought at the time it was The D'sBlox (Only a Few Native People will Understand this!) But for the others...Very Good!
I also had many other Dedicated Electronic Chess Boards...Then the Software became so Strong! and so it was Good Bye to Them.

GiB.

comment removed - insulting, flaming.

Hi Bobby,

Arena 3.0 Build 2542

I belonged to a chess club at school but was never too serious about it after that and played infrequently since.

I liked holding little tournaments between Sargon, ChessMaster, Novag Constellation and a Hanimex computer I had. Haven't played chess for years, but played 25 or so games of Loser's chess over Christmas and quite enjoyed it. Winning, that is...or did I mean losing? Interesting game play!

Last edited by phrontister (2011-01-27 01:32:50)