TalkChess.com

Well, maybe I was a bit harsh, I'm sorry for that. The point is that manufacturers want you to buy their stuff and sales people just tell you what the manufacturer tells them. I didn't mean to say that sales people are incompetent to sell stuff, but most of them have no clue about the tech behind t...

Yesterday I bought some loudspeaker cable, there was an arrow on in, the guy told me that the arrow should point in the direction of the loudspeaker because the the signal goes from the amplifier to the speaker, of course I told him this is complete nonsense and the guy got really mad at me. Actual...

Yesterday I bought some loudspeaker cable, there was an arrow on in, the guy told me that the arrow should point in the direction of the loudspeaker because the the signal goes from the amplifier to the speaker, of course I told him this is complete nonsense and the guy got really mad at me. Actual...

chrisw wrote: ↑

Fri Jun 07, 2019 2:43 pm

Puzzle. Suppose a search takes X nodes and the hashtable is 2^n in size. You would like to be 95% confident no two nodes have a hash collision.

What’s the formula connecting X and n?

This will occupy my mind for days and in the end I won't be able to solve it, thank you very much.

Jp Coming close to the hot point. When you continue 6.Nc4 (which is inferior line according to Stockfish) after 10 moves , Stockfish evaluates -3.54 for black. But when you continue 6.Nxf7 (Stockfish’s best choice for white ), then 10 moves afterward, Stockfish evaluates -4.57 for black ! Is this l...

As you may know Mortimer trap is a famous trap in Ruy lupez openining .(google it and you’ll find it easily). Also it’s a valid test for new chess engines! According to all chess literature and famous GMs the best continuation in move 6 for white is 6.Nc4 ?! But when you test the position by Stockf...

Including underpromotion to knight? Yes, it's not worth the effort in QS. In main search however, underpromotions should be searched. Even in main search you can omit under-promotions to bishop, at least I've never seen a game where under-promotion to bishop led to anything useful. It happens once ...

Robert Pope wrote: ↑

Mon May 06, 2019 4:17 pm

Isn't the average branching factor for AB with random sorting = sqrt(N) (ignoring odd/even effects). So AB at 6 ply would be somewhere on the order of 6^6 ~ 50K nodes.

That's with perfect move ordering, IIRC.

So far all I have is a material searcher. From the initial position it returns a score of either 100 or -100 depending upon the modification or search depth. Well, that should be impossible if you only search a few ply, although I'm not sure what you mean by modification. If I were you I would add ...

Someone builds some sort of super train being able to cover L.A to NYC in 10 hours. Everyone is cheering.

As it turns out, it reaches Philadelphia in 5 hours and stands still there for 4½ hours before finishing the journey. Now everyone is booing.

Oh, the stupid masses.