Computer Chess Club Archives

Search

Messages

Subject: Re: Non recursive search(is there a free source code for doing it?)

Author: Omid David Tabibi

Date: 15:22:18 04/12/04

Go up one level in this thread

On April 11, 2004 at 17:05:00, Dan Andersson wrote:

> Any reasonable one should. But since C/C++ have serious holes in their type
>systems amongst other shorcomings it is usually in a limited form. There have
>been proposals of a special tail_call form.
> Earlier GCC (old 2.x branch) only performed it at the the front end. And only
>with an explicit return. Mutual recursion was also a hindrance.
> As an aside I believe that the MS C# doesn't do tail call optimizations.

I was reading some benchmarks in a newsgroup suggesting that C# is even slower
than Java. So, as far as optimizations go, don't count on it :)



>
>MvH Dan Andersson

• Re: Non recursive search(is there a free source code for doing it?) Russell Reagan 16:30:09 04/12/04
  • Re: Non recursive search(is there a free source code for doing it?) Omid David Tabibi 17:00:59 04/12/04

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.