Re: Challenge

Subject: Re: Challenge
From: Bernard Domroy <bdomroy@IEPSNET.COM>
Date: Sat, 24 Aug 1996 12:51:17 -0700
In-Reply-To: <Challenge>

Great!!! let's all argue about this now.  Either you can do it, or you
can't.  If you can -- do it.  If not -- don't.


At 20:33 8/23/96 -0400, you wrote:
>In article <4vja71$v70@taco.cc.ncsu.edu> psnarula@unity.ncsu.edu (Pritpal Singh
>Narula) writes:
>:
>>:     Believe it or not, this IS possible!!!!!!  I
>>
>>I find it hard to belive you can write a chess algorithm on 32K of memory...
>
>Pop on down to Radio Shack and look at how much memory the dedicated chess
>computers have that are sold there.
>
>Matt Tuley
>mtuley@jeffco.k12.co.us
>

References:

From:

Prev: Re: Q:prg slowing down-why?
Next: Any one want to trade??????
Index(es):
- Main
- Thread