Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: to Peter Kappler - re:Grok

Author: scott farrell

Date: 15:13:10 11/14/03

Go up one level in this thread


On November 14, 2003 at 12:57:02, Peter Kappler wrote:

>On November 14, 2003 at 06:32:19, scott farrell wrote:
>
>>On November 14, 2003 at 01:31:49, Mridul Muralidharan wrote:
>>
>>>On November 13, 2003 at 18:44:55, scott farrell wrote:
>>>
>>><snip>
>>>>Do you have any code for EGTB you can lend? I use web services accross the web.
>>>>
>>>>sfarrell@icconsulting.com.au (in case you want to take this offline)
>>>>Scott
>>>
>>>You have written code to expose chompster as a webservice ?
>>
>>No, I use a web service for egtb:
>>http://www.lokasoft.nl/uk/tbapi.htm
>>
>
>I hope you aren't using that in serious games.  80-90 ms per tablebase lookup
>will kill your search.  I suppose you could use it just at the root.
>
>-Peter

Its closer to 750ms, at the root it's OK, in the tree I do it in a seperate
thread witha queue of positions, it helps occasionally.

Scott

>
>
>>>Where is this deployed ?
>>>Maybe I could take a look at the exposed methods - you expose anything to take
>>>an fen string and analyse it ?
>>>
>>>Exposing it mess as a web-service was one of the things that I want to try out
>>>... using JNI (java is much more easier to write web-services in ;) ) , whatever
>>>- since messchess is in C
>>>
>>>Thanks and Regards
>>>Mridul



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.