Computer Chess Club Archives

Search

Messages

Subject: longjmp question

Author: Ross Boyd

Date: 03:00:58 06/20/04

My engine (coded in C) uses longjmp() to terminate a search.

Is there any disadvantage or hidden overhead in this approach?

I notice other engines use a flag which is tested at every node of the search.
Surely there's an overhead in doing it that way????

I suppose the main drawback of longjmp() is portability. Most languages other
than C don't support it.

Am I missing something?

Ross

• Re: longjmp question Robert Hyatt 09:31:12 06/20/04
  • Re: longjmp question Ross Boyd 15:59:30 06/20/04
• Re: longjmp question Gerd Isenberg 09:08:16 06/20/04
  • Re: longjmp question Ross Boyd 16:15:50 06/20/04
• Re: longjmp question Uri Blass 04:20:11 06/20/04
  • Re: longjmp question Ross Boyd 04:44:25 06/20/04
    • Re: longjmp question Dann Corbit 12:13:40 06/21/04
    • Re: longjmp question Uri Blass 09:13:59 06/20/04
      • Re: longjmp question Uri Blass 09:25:05 06/20/04
        • Re: longjmp question Ross Boyd 16:47:04 06/20/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.