bright-0.2c released

Discussion of anything and everything relating to chess playing software and machines.

Moderator: Ras

ernst
Posts: 354
Joined: Thu Mar 09, 2006 6:00 pm

Re: bright-0.2c released

Post by ernst »

Hello Allard,

Indeed your output is knps, but that is not the uci standard and it is comfusing the shreddder GUI which calculates the nps to knps and is showing a hash usage of i.e. 202.6%. Not that I have a problem with it, but nevertheless reporting it isn't a bad idea. :-)

Reg. the hash size, taking powers of two doesn't help. Below is the info from the log file. I started with 1450MB and set it to 2GB. FYI, OS is WinXP x64 with 4GB RAM.

To be precise, the biggest hashsize I can give is 1453MB.

Code: Select all

0411047203:<--uciok
0411047234:setoptionname Hash value 1450
resizing hash to 1450Mb
tt.kb     =1484800
tt.entries=5aa0000
tt.addr   =102e0080
resized
0411047984:isready
0411047984:<--readyok
0411169609:setoptionname Hash value 2048
resizing hash to 2048Mb
tt: malloc(-2147483648) failed, retrying...
tt.kb     =2097152
tt.entries=4000000
tt.addr   =102e0080
resized
btw, Ik woon ook ik nederland :-)

Allard Siemelink wrote:Hi Ernst,

The nps in the uci output is actually knps (nps/1024), does it cause you any trouble?

You probaby discovered a bug in the hash allocation, I will look into that.
Meanwhile, you may try specifying an exact power of two of for the hash size, e.g. 1024 or 2048 Mb.


ernst wrote:Thanks Allard for this great engine.

However I am unable to use more than 1450MB hash or the memory used drops again. I have a Q6600 and 4GB RAM.

Futhermore when you look at the output from the engine, there are two anomalies.

Code: Select all

### from bright-0.2c (1): info currmove e2e4 currmovenumber 1 time 110406 nodes 561315392 nps 5084 hashfull 2026
Both the nps and the hashfull info aren't conform the uci standard.
Allard Siemelink
Posts: 297
Joined: Fri Jun 30, 2006 9:30 pm
Location: Netherlands

Re: bright-0.2c released

Post by Allard Siemelink »

Ok, I see now: it is a sign bug! it actually attempts to allocate -2048Mb of memory which fails, of course.
Then it devides the requested memory by 2 and allocates 1024Mb succesfully.

The hashfull% also has a bug: it fails to take into account some of the overwritten entries.

Thanks for reporting both issues.

Groeten,

-Allard
ernst wrote:Hello Allard,

Indeed your output is knps, but that is not the uci standard and it is comfusing the shreddder GUI which calculates the nps to knps and is showing a hash usage of i.e. 202.6%. Not that I have a problem with it, but nevertheless reporting it isn't a bad idea. :-)

Reg. the hash size, taking powers of two doesn't help. Below is the info from the log file. I started with 1450MB and set it to 2GB. FYI, OS is WinXP x64 with 4GB RAM.

To be precise, the biggest hashsize I can give is 1453MB.

Code: Select all

0411047203:<--uciok
0411047234:setoptionname Hash value 1450
resizing hash to 1450Mb
tt.kb     =1484800
tt.entries=5aa0000
tt.addr   =102e0080
resized
0411047984:isready
0411047984:<--readyok
0411169609:setoptionname Hash value 2048
resizing hash to 2048Mb
tt: malloc(-2147483648) failed, retrying...
tt.kb     =2097152
tt.entries=4000000
tt.addr   =102e0080
resized
btw, Ik woon ook ik nederland :-)
ernst
Posts: 354
Joined: Thu Mar 09, 2006 6:00 pm

Re: bright-0.2c released

Post by ernst »

Glad to be of help, ready for bright-0.2d :-)
Jouni
Posts: 3729
Joined: Wed Mar 08, 2006 8:15 pm
Full name: Jouni Uski

Re: bright-0.2c released

Post by Jouni »

I quess Bright's node counter is only 32b, because after 4 billion there is
overflow = node counter stops.

+- (5.47) Depth: 26/51 00:02:43 172mN
1.b3 Bxb3 2.Kxb5 Bd1 3.a4 Bf3 4.Kb6 Be4 5.a5 Kg6 6.a6 Bd5 7.a7 Ba8 8.Kc7 Be4 9.Kb8 Bd5 10.a8Q Bxa8 11.Kxa8 Kf7 12.Kb8 Kg6 13.Kc7 Kf7 14.Kd6 Kg6 15.Kd5 Kxh6 16.Kxc4
+- (5.79) Depth: 27/54 00:04:45 302mN
1.b3 Bxb3 2.Kxb5 Bd1 3.a4 Bf3 4.Kb6 Be4 5.a5 Kg6 6.a6 Bd5 7.a7 Ba8 8.Kc7 Be4 9.Kb8 Bd5 10.a8Q Bxa8 11.Kxa8 Kf7 12.Kb8 Kg6 13.Kc7 Kf7 14.Kd6 Kg6 15.Kc5 Kxh6 16.Kxc4
+- (5.79) Depth: 28/58 00:07:16 494mN
1.b3 Bxb3 2.Kxb5 Bd1 3.a4 Bf3 4.Kb6 Be4 5.a5 Kg6 6.a6 Bd5 7.a7 Ba8 8.Kc7 Be4 9.Kb8 Bc6 10.a8Q Bxa8 11.Kxa8 Kf7 12.Ka7 Ke6 13.Kb6 Kf7 14.Kb5 Kg6 15.Kxc4 Kxh6 16.f7
+- (6.18) Depth: 29/62 00:16:55 1076mN
1.b3 Bxb3 2.Kxb5 Bd1 3.a4 Bf3 4.Kb6 Be4 5.a5 Kg6 6.a6 Bd5 7.a7 Ba8 8.Kc7 Be4 9.Kb8 Kf7 10.a8Q Bxa8 11.Kxa8 Ke6 12.Kb7 Kd6 13.Be5+ Ke6 14.Ka6 Kf7 15.Bd4 Kg8 16.Kb5 Kf7
+- (6.15) Depth: 30/66 00:58:07 3661mN
1.b3 Bxb3 2.Kxb5 Bd1 3.a4 Bf3 4.Kb6 Be4 5.a5 Kg6 6.a6 Bd5 7.a7 Ba8 8.Kc7 Be4 9.Kb8 Bd5 10.a8B Be6 11.Be4+ Kxh6 12.Be3+ Kh5 13.Bxh7 Bf7 14.Be4 Kh4 15.Kc7 Kh5 16.Kd6 Kh4
+- (6.47) Depth: 31/67 02:46:37 3661mN

This is only cosmetic glitch, but in fast PC this happens in 10 minutes, because Bright is so fast!

Jouni
Allard Siemelink
Posts: 297
Joined: Fri Jun 30, 2006 9:30 pm
Location: Netherlands

Re: bright-0.2c released

Post by Allard Siemelink »

Yes, the node counter is 32 bits. I'll put it on my todo list.

Happy New Year,

-Allard
Jouni wrote:I quess Bright's node counter is only 32b, because after 4 billion there is
overflow = node counter stops.

This is only cosmetic glitch, but in fast PC this happens in 10 minutes, because Bright is so fast!

Jouni
ernst
Posts: 354
Joined: Thu Mar 09, 2006 6:00 pm

Re: bright-0.2c released

Post by ernst »

Hello Allard

Happy new year to you too. Are you planning to fix the hashtable problem any time soon? I would love to be able to use bigger hashtables for analyzing.
Allard Siemelink
Posts: 297
Joined: Fri Jun 30, 2006 9:30 pm
Location: Netherlands

Re: bright-0.2c released

Post by Allard Siemelink »

Hi Ernst,

It turns out that the 'sign bug' I mentioned only affects the log output.
The actual call to allocate the memory is correct, but fails.

Unfortunately it seems to be limitation of 32-bit Windows.
According to http://www.microsoft.com/whdc/system/pl ... AEmem.mspx,
the maximum address space for a process is 2Gb.
Since part of that is already in use, this would explain the inability to set the Hash to 2Gb or more.
(For Bright or any other 32-bit engine)

ernst wrote:Hello Allard

Happy new year to you too. Are you planning to fix the hashtable problem any time soon? I would love to be able to use bigger hashtables for analyzing.
ernst
Posts: 354
Joined: Thu Mar 09, 2006 6:00 pm

Re: bright-0.2c released

Post by ernst »

Hi Allard,

You probably know this slogan: "De oplossing is altijd simpel" :D

A 64 bit compile would solve it nicely. :roll: :wink:
Jouni
Posts: 3729
Joined: Wed Mar 08, 2006 8:15 pm
Full name: Jouni Uski

Re: bright-0.2c released

Post by Jouni »

Thanks Allard for this great engine! It's tactical speed is stunning as well as node speed (2 000 000 nps in my old PC). In one of my test suites it's
better than ANY pro engine... In endgame tests it's no patzer either with
4 piece bitbases.

Jouni

PS. 2^8 posts :)
Allard Siemelink
Posts: 297
Joined: Fri Jun 30, 2006 9:30 pm
Location: Netherlands

Re: bright-0.2c released

Post by Allard Siemelink »

Jouni wrote:Thanks Allard for this great engine! It's tactical speed is stunning as well as node speed (2 000 000 nps in my old PC). In one of my test suites it's
better than ANY pro engine... In endgame tests it's no patzer either with
4 piece bitbases.

Jouni

PS. 2^8 posts :)
8-) which suite?