Search found 243 matches

by Carey
Thu Aug 27, 2009 7:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Critter: Pascal vs C
Replies: 19
Views: 7231

Re: Critter: Pascal vs C

Not many people would say that Delphi is a high performance compiler.... Or any of the old 'Turbo' tools, for that matter. You might get better results from FreePascal. It also has a 64 bit version for both Windows and Linux. The Lazarus development environment is much weaker than most C environment...
by Carey
Wed Aug 26, 2009 8:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

The Levy / Newborn book says the SOMA analyzer program was done by Maynard Smith. I didn't realize you didn't know the first name. Is it this John Maynard Smith? It just says Maynard Smith. I would assume "Maynard" is the first name, but I suppose it's possible he didn't like "John" and went by his...
by Carey
Wed Aug 26, 2009 7:23 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

As I said, I don't like to bother people with personal demanding requests. With time information will pass its way. Of course any help appreciated. I know you don't like to bother them, but it's been my experience that many of them don't feel bothered. One email. If they don't want to mess with it,...
by Carey
Wed Aug 26, 2009 6:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

Gerd, You probably already have this info, but I came across a couple pages about it in David Levy & Monty Newborn's "How Computers Play Chess". They call it an "analyzer" since it didn't do much searching. It talks a bit about the eval, how mobility & attacks were calculated & scored, etc. It only...
by Carey
Wed Aug 26, 2009 6:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

Sure, but there is still the question about the program of M. Smith called SOMA from 1961. And the SOMA algorithm by Donald Michie from 1966! Looking for references. For Michie, how about checking "On Machine Intelligence", 1974, Donald Michie. In the Spracklen's article on writing Sargon, they say...
by Carey
Wed Aug 26, 2009 5:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

Gerd, You probably already have this info, but I came across a couple pages about it in David Levy & Monty Newborn's "How Computers Play Chess". They call it an "analyzer" since it didn't do much searching. It talks a bit about the eval, how mobility & attacks were calculated & scored, etc. It only ...
by Carey
Fri Aug 14, 2009 2:36 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: SOMA
Replies: 29
Views: 5704

Re: SOMA

Hi Gerd, I am not aware of SOMA, let alone his work. Would be fun indeed to know what he invented. About ancient history, did you know that Don Beal in Cologne 1986 played with Bcp that used null-move in QS? I wish I had paid more attention back then when he explained :wink: Ed I have a copy of Don...
by Carey
Mon Jun 22, 2009 10:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Chaos questions
Replies: 4
Views: 1097

Re: Chaos questions

Can't help you much on the technical details of CHAOS since I have not yet seen the source for it. I can say, however, that if you want, you could contact the authors (Fred S. or Mike A.) directly and get their direct say. (Probably Mike A. might be more responsive.) Last I heard, Mike was trying to...
by Carey
Fri Jun 05, 2009 1:45 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Bitboards using 2 DOUBLE's??
Replies: 20
Views: 2529

Re: Bitboards using 2 DOUBLE's??

Big snipping of dead wood to get this thing down to size.... Doesn't matter what I *want*. The reality is that's what the FPU does. So you live with it. You work with abstractions instead. Let's get back to the _real_ world. The chess board can not be abstracted, because it has to be evaluated, and ...
by Carey
Wed Jun 03, 2009 8:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Bitboards using 2 DOUBLE's??
Replies: 20
Views: 2529

Re: Bitboards using 2 DOUBLE's??

BTW, one error above. You have 52 bits, not 53. The 53rd bit _must_ be a 1 bit (the IEEE "hidden" bit). Sorry Bob, but no. Obvious example is the number zero. It has no bits set. (Yes, I know it uses a special exponent code to indicate zero.) Here we are going to have to disagree, because I teach I...