Search found 17077 matches

by bob
Sun Jul 22, 2007 7:36 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Technical question about the Core 2 Duo and Mac OS X
Replies: 45
Views: 20762

Re: Technical question about the Core 2 Duo and Mac OS X

I haven't tried it lately, but I think a more realistic assessment of the code produced by Intel's compiler might be, 5% faster than MSVC (and 5-10% larger code size). I've never found ICC to be faster than MSVC. It has always been "fairly close". Gcc has generally lagged behind MSVC by 30% or so d...
by bob
Sun Jul 22, 2007 7:35 pm
Forum: Computer Chess Club: General Topics
Topic: Checkers Solved - Chess around year 2060-2070!
Replies: 100
Views: 38910

Re: Checkers Solved - Chess around year 2060-2070!

Sorry, but you can't _prove_ until you do search all pathways. That's the very definition of proof. "we think" does not mean "it is". Funny Jonathan found a better way! What other way? He pruned out the BS, concentrated on wins and draws etc. He reduced the problem by a huge number of useless posit...
by bob
Sun Jul 22, 2007 6:49 pm
Forum: Computer Chess Club: General Topics
Topic: Checkers Solved - Chess around year 2060-2070!
Replies: 100
Views: 38910

Re: Checkers Solved - Chess around year 2060-2070!

You simply wave your hands and say "but it will be solved, if we can develop a parallel-universe memory system, or some type of quantum-computing that has not yet been conceived, or dream up some completely new and never even imagined way to attack the game. the rest of us look at what we have, wher...
by bob
Sun Jul 22, 2007 6:47 pm
Forum: Computer Chess Club: General Topics
Topic: Checkers Solved - Chess around year 2060-2070!
Replies: 100
Views: 38910

Re: Checkers Solved - Chess around year 2060-2070!

I think that chess will be solved but not by conventional thinking. It already seems that chess is a draw because till today not a single opening has been found that guarantees a win with best play. While it can get a win OTB, others can always find refutations and manage to equalize. So it seems f...
by bob
Sun Jul 22, 2007 6:45 pm
Forum: Computer Chess Club: General Topics
Topic: Checkers Solved - Chess around year 2060-2070!
Replies: 100
Views: 38910

Re: Checkers Solved - Chess around year 2060-2070!

Sorry, but you can't _prove_ until you do search all pathways. That's the very definition of proof. "we think" does not mean "it is". Funny Jonathan found a better way! What other way? He pruned out the BS, concentrated on wins and draws etc. He reduced the problem by a huge number of useless posit...
by bob
Sun Jul 22, 2007 6:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Monte Carlo chess
Replies: 5
Views: 3814

Re: Monte Carlo chess

In go programming they're having success with the monte carlo method, where you evaluate by playing a great number of random games and looking at the win/loss ratio. I've adapted my chess engine to do something similar by playing 1000 random games per rootmove and then choosing the move with the hi...
by bob
Sun Jul 22, 2007 4:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fruit and History Reductions
Replies: 22
Views: 12473

Re: Fruit and History Reductions

Source will be available soon. But simply we look at each individual move to decide whether to reduce it or not. At today's depths, the history counters are essentially nothing more than a good source of random numbers... The last sentence is comforting, in a sense... Anyways, are you relying on ch...
by bob
Sun Jul 22, 2007 4:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Fruit and History Reductions
Replies: 22
Views: 12473

Re: Fruit and History Reductions

Source will be available soon. But simply we look at each individual move to decide whether to reduce it or not. At today's depths, the history counters are essentially nothing more than a good source of random numbers.... That can be easily dealt with, just don't update/reduce after the xx ply. Yo...
by bob
Sun Jul 22, 2007 4:46 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Technical question about the Core 2 Duo and Mac OS X
Replies: 45
Views: 20762

Re: Technical question about the Core 2 Duo and Mac OS X

This estimate is for the same (32-bit) binary. For 64-bit you get an extra acceleration, which of course strongly depends on how much 64-bit arithmetic you do compared to 32-bit stuff. For the 64-bit stuff itself it could be more than a factor 2. Thanks, that sounds a lot better! Apparently my prog...
by bob
Sun Jul 22, 2007 4:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Technical question about the Core 2 Duo and Mac OS X
Replies: 45
Views: 20762

Re: Technical question about the Core 2 Duo and Mac OS X

Hello, I am considering replacing my first-generation Core Duo MacBook with one of the new Core 2 Duo MacBooks (they got a minor speed bump a few days ago). Before I buy, I have a very basic technical question: I've been told that the AMD 64-bit CPUs require a 64-bit OS in order to run in 64-bit mo...