Search found 181 matches

by Pio
Mon Feb 27, 2017 6:03 pm
Forum: Computer Chess Club: General Topics
Topic: Best Computer Chess Program
Replies: 36
Views: 8435

Re: Best Computer Chess Program

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
by Pio
Mon Jan 23, 2017 6:01 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: bound type in PVS ?
Replies: 3
Views: 1342

Re: bound type in PVS ?

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?
by Pio
Sat Nov 05, 2016 8:21 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Python script for TTM
Replies: 37
Views: 8419

Re: Python script for TTM

I am glad that you for once listned to me even though you quoted yourself :)
by Pio
Wed Nov 02, 2016 9:59 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Python script for TTM
Replies: 37
Views: 8419

Re: Python script for TTM

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

/Pio
by Pio
Sat Oct 08, 2016 9:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash table transformation
Replies: 9
Views: 1997

Re: Hash table transformation

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...
by Pio
Thu Oct 06, 2016 8:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash table transformation
Replies: 9
Views: 1997

Re: Hash table transformation

Hi Gerd! Thank you so much for the chess programming wiki. I love it. My color agnostic way uses the board representation I invented and described http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=538593&t=49575 I made my board representation color agnostic by traversing the board in...
by Pio
Wed Oct 05, 2016 9:14 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash table transformation
Replies: 9
Views: 1997

Re: Hash table transformation

Hi Dann! I store the board so that black and white does not matter. That can be good in the beginning if you make your own opening database. I store the entire board in 3*64 bits, do copymake and fix the color and board mirroring branch less so I do not need to do Zobrist hashing. One more advantage...
by Pio
Wed Aug 03, 2016 10:39 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Some thoughts about draws
Replies: 3
Views: 1103

Re: Some thoughts about draws

Please, anyone correct me if I'm wrong. Some engines does not colapse evaluations to 0 on repetition even if they don't know how they/the rival will improve, like Gull. The advantage of this is having an evaluation more detailed (!=0). The disadvantage is that they can confuse a draw with a non dra...
by Pio
Wed Aug 03, 2016 8:34 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Some thoughts about draws
Replies: 3
Views: 1103

Some thoughts about draws

Hi! It seems to me that engines normally evaluate draws as zero. I think that is wrong. As an example assume that you are on the move. You have two possible moves: "Move 1" where you can prove that whatever move the opponent may do you can draw (either by repetition, tablebases, insufficent material...
by Pio
Sat Mar 19, 2016 1:50 am
Forum: Computer Chess Club: General Topics
Topic: Komodo 9.4
Replies: 76
Views: 15188

Re: Komodo 9.4

Hi Larry! I think mainly the reason why more aggresive values for king's safety works for longer time controls is because it helps the search prune entire sub trees when finding draws due to three fold repitition in otherwise inferior positions or when finding wins/losses. I think you could gain a l...