At 07:16 12/04/01 +0200, you wrote:
>BTW, have you ever thought about rewriting the solver C++ ?
Perhaps, but I don't see much point to it at the moment.
>You could abstract away quite a number of implementation
>details and easily plug in new algorithms for the various
>data structures - even selecting the best implementation
>for a specific game at run time.
You mean, that I will give the user a choice between compact states and
indirect stack states at run-time? Or a choice for which state/stack
allocation mechanism to use at run-time (e.g: internal hash, libavl,
libredblack)? The latter can also be done in ANSI C without too much
hassle, but the former seems like just a headache.
Can you elaborate on what you mean?
>Getting those things right requires a careful planning, though...
I suppose it does.
Regards,
Shlomi Fish
>Markus
----------------------------------------------------------------------
Shlomi Fish shlomif_at_techie.com
Home Page:
http://t2.technion.ac.il/~shlomif/
I don't believe in fairies. Oops! A fairy died.
I don't believe in fairies. Oops! Another fairy died.
Received on Thu Apr 12 2001 - 03:30:00 IDT