Re: [computer-go] Tree Contention

2009-04-15 Thread Ryan Grant
lockless hash table references. essential. On Mon, Apr 13, 2009 at 3:08 PM, Rémi Coulom remi.cou...@univ-lille3.fr wrote: Michael Williams wrote: What tricks are people doing to minimize the performance degradation due to multiple threads contending for access to the tree (in MCTS)?  Do you

[computer-go] COGS bug in Ko detection?

2009-04-15 Thread Harry Fearnley
[computer-go] COGS bug in Ko detection? === Sorry to jump into this thread -- I have only just joined the compgo mailing list since Nick Wedd told me that my work on Hanezeki had been mentioned here ... In reply to Terry McIntyre terrymcint...@yahoo.com

Re: [computer-go] Computer Olympiad Reminder

2009-04-15 Thread Rémi Coulom
Rémi Coulom wrote: Hi, If you plan to participate in the Computer Olympiad, then don't forget to register soon. The deadline for early registration is April 15th: http://www.grappa.univ-lille3.fr/icga/event_info.php?id=25 We have received the registrations of 7 programs so far. Hi, I have

Re: [computer-go] Tree Contention

2009-04-15 Thread Jason House
On Apr 14, 2009, at 7:57 PM, Rémi Coulom remi.cou...@univ-lille3.fr wrote: Jason House wrote: Out of curiosity, how do you intelligently delete old nodes? Reference counting won't always work due to cycles, and a nieve scan of the tree could block all threads. I store a date of birth in

Re: [computer-go] Tree Contention

2009-04-15 Thread Michael Williams
You can change the value all you want. You just can't change the key. Jason House wrote: On Apr 14, 2009, at 7:57 PM, Rémi Coulom remi.cou...@univ-lille3.fr wrote: Jason House wrote: Out of curiosity, how do you intelligently delete old nodes? Reference counting won't always work due to

Re: [computer-go] Tree Contention

2009-04-15 Thread Jason House
On Apr 15, 2009, at 6:50 PM, Michael Williams michaelwilliam...@gmail.com wrote: You can change the value all you want. You just can't change the key. Right... That's the design in the google talk. Remi said he can reuse cache entries and so avoids resizing / copying (greatly

Re: [computer-go] Tree Contention

2009-04-15 Thread Michael Williams
I think your hash value is your first-try index into the hash table. So a 32-bit hash would be a 4E9 sized table. Probably too big for Remi's computer. I'd guess that he's using something between 16 and 32 bits in his hash hey. Jason House wrote: On Apr 15, 2009, at 6:50 PM, Michael

Re: [computer-go] Tree Contention

2009-04-15 Thread Rémi Coulom
Jason House wrote: On Apr 15, 2009, at 6:50 PM, Michael Williams michaelwilliam...@gmail.com wrote: You can change the value all you want. You just can't change the key. Right... That's the design in the google talk. Remi said he can reuse cache entries and so avoids resizing / copying

Re: [computer-go] April 2009 KGS tournament

2009-04-15 Thread Yamato
Ingo Althöfer wrote: Other question: Might it be possible to find a volunteer for operating Zen19 in Pamplona? I forgot to say it here - Mr. Kato came forward as an operator of Zen. It will play via KGS. Have a good game, all. -- Yamato ___ computer-go

Re: [computer-go] April 2009 KGS tournament

2009-04-15 Thread Hideki Kato
Yamato: 20090416003730.32a584...@aic-smtp1.ayu.ne.jp: Ingo Althöfer wrote: Other question: Might it be possible to find a volunteer for operating Zen19 in Pamplona? I forgot to say it here - Mr. Kato came forward as an operator of Zen. I'll, of course, operate Fudo Go as well. I believe this