TalkChess.com

Hej Patrik! I would not say that you missed a single thing. I would say that you are a genius that could solve so many Rubriks' cubes at once. SMP when it is at its best :) /Pio PS Jag tror att du skulle förbättra din automatiska Texel tuning om du ändrade till att minimera det absoluta felet och in...

Hi Henk! I save my board in 3*64 = 192 bits but you can do it more efficiently. See my post http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=538593&t=49575 You can also see the quad board representation on the superb chess programming wiki if you want a compact and fast representati...

I would play bishop h6

Hi, is it Nf4h3? It was the first move that I thought of.

Hi Fermin! I think the key to solve these types of problems is for the engine to recognize/realise that the white king cannot advance to the middle or right side of the board. The valuable own pawns should be attractors to the king and when the board clears it should be evident that the white king i...

Hi!

I am sure that Daniel's Andscacs is more original than most other engines.

You can see it from the posts Daniel is doing in the technical forum. Just because some people cannot improve very fast it does not mean there is no exception.

/Pio

I guess that they do not save the entry of insufficient material because it takes time to save and read from the tt. Why not check for insufficent material before reading from the tt?

I am glad that you for once listned to me even though you quoted yourself

Hi, I think you will get much better result if you try to minimize the absolute error.

/Pio

Thanks Gerd for the suggestions! Those two instructions could come very handy when applying the move on the board (and in many other places). I am just doing this for fun in C# in more or less C way (no important objects) doing the bit masking and shifting myself instead of the much smarter chip ins...