Speed 2017

Discussion of chess software programming and technical issues.

Moderator: Ras

Robert Pope
Posts: 570
Joined: Sat Mar 25, 2006 8:27 pm
Location: USA
Full name: Robert Pope

Re: Speed 2017

Post by Robert Pope »

Henk wrote:
AlvaroBegue wrote:
Henk wrote:Perft gives 149 kilo nodes per second. Uses same move iterator.
Henk wrote:Counting material only gives 500KN/second
That makes no sense.
If perft uses other move iterator that does not do move ordering, it is 1.3MN/second. Perft calls the slow move iterator of search so it may help catching bugs.
Abbess isn't fast by any means, but it gets 6-10M nps in perft and 1M nps in search.
AlvaroBegue
Posts: 932
Joined: Tue Mar 09, 2010 3:46 pm
Location: New York
Full name: Álvaro Begué (RuyDos)

Re: Speed 2017

Post by AlvaroBegue »

Henk wrote:
AlvaroBegue wrote:
Henk wrote:Perft gives 149 kilo nodes per second. Uses same move iterator.
Henk wrote:Counting material only gives 500KN/second
That makes no sense.
If perft uses other move iterator that does not do move ordering, it is 1.3MN/second. Perft calls the slow move iterator of search so it may help catching bugs.
I remain unconvinced. Why should move ordering slow down perft more than an actual search? And what on Earth are you doing in your move ordering that eats up nearly 90% of the CPU time?
Henk
Posts: 7251
Joined: Mon May 27, 2013 10:31 am

Re: Speed 2017

Post by Henk »

AlvaroBegue wrote:
Henk wrote:
AlvaroBegue wrote:
Henk wrote:Perft gives 149 kilo nodes per second. Uses same move iterator.
Henk wrote:Counting material only gives 500KN/second
That makes no sense.
If perft uses other move iterator that does not do move ordering, it is 1.3MN/second. Perft calls the slow move iterator of search so it may help catching bugs.
I remain unconvinced. Why should move ordering slow down perft more than an actual search? And what on Earth are you doing in your move ordering that eats up nearly 90% of the CPU time?
For move ordering it ranks quiet moves. perft passes all moves so there is no fail high after a good capture or killer. It doesn't use Piecesquare table when there are no history statistics about the move.
User avatar
Luis Babboni
Posts: 464
Joined: Sat Feb 28, 2015 4:37 pm
Location: Argentina

Re: Speed 2017

Post by Luis Babboni »

Henk wrote:Counting material only gives 500KN/second
In wich machine?

Mine count just material and have a speed of 200KN/s*!! :-D
* in a Phenom 955.
flok

Re: Speed 2017

Post by flok »

Embla does 16975 nodes per second on a raspberry pi 2. Jet it beats fairymax.
Henk
Posts: 7251
Joined: Mon May 27, 2013 10:31 am

Re: Speed 2017

Post by Henk »

If it ranks quiet moves using history statistics only it's speed goes to 260 KN/s. That's 3 times slower than Fairy-max.
Sven
Posts: 4052
Joined: Thu May 15, 2008 9:57 pm
Location: Berlin, Germany
Full name: Sven Schüle

Re: Speed 2017

Post by Sven »

Henk wrote:If it ranks quiet moves using history statistics only it's speed goes to 260 KN/s. That's 3 times slower than Fairy-max.
Don't bother with speed until your engine has become considerably stronger. Consider this reply:
Folkert van Heusden wrote:Embla does 16975 nodes per second on a raspberry pi 2. Jet it beats fairymax.
So maybe you have to fix your bugs first?
Henk
Posts: 7251
Joined: Mon May 27, 2013 10:31 am

Re: Speed 2017

Post by Henk »

Yes if it in evaluation I just comment out some terms. It diminishes possible bugs and improves speed as well.

Maybe Embla is using some clever pruning.