RE: Re[2]: [cc65] dummy questions...

Date view Thread view Subject view

From: Keates, Mark (Mark.Keates_at_dendrite.com)
Date: 2002-02-18 13:20:38 

Aren't both of these 'solvers' recursion based?
Would the standard cc65 stack frames cope with this?

Just a thought.

> -----Original Message-----
> From: groepaz [mailto:groepaz_at_gmx.net]
> Sent: 17 February 2002 14:50
> To: Marko Mäkelä
> Subject: Re[2]: [cc65] dummy questions...
> 
> 
> Hello Marko,
> 
> Saturday, February 16, 2002, 11:34:50 PM, you wrote:
> 
> MM> groepaz wrote:
> >> oooh good idea.... towers of hanoi can serve as a pretty good
> >> programming example aswell ;0)
> 
> MM> Also, there's the "n queens" puzzle (create a chess board 
> of n by n 
> MM> elements and place n queens on it in such a way that no 
> two queens are 
> MM> on the same vertical, horizontal or diagonal line).  I 
> think I saw it in 
> MM> the "examples" directory of bcc (Bruce Evans' C 
> compiler), a C compiler 
> MM> targeted for the 8086, available from 
> MM> <URL:http://www.cix.co.uk/~mayday/>.   The problem should 
> be famous 
> MM> enough so that you could find benchmark data for it.
> 
> 8queens.c is in my testsuite already :o) (was in the lcc testsuite
> aswell)
> 
> -- 
> Best regards,
>  groepaz                            mailto:groepaz_at_gmx.net
> 
> 
----------------------------------------------------------------------
To unsubscribe from the list send mail to majordomo_at_musoftware.de with
the string "unsubscribe cc65" in the body(!) of the mail.

Date view Thread view Subject view

This archive was generated by hypermail 2.1.3 : 2002-02-18 13:22:03 CET