From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fdb77,5f529c91be2ac930
X-Google-Attributes: gidfdb77,public
X-Google-Thread: 1108a1,59ec73856b699922
X-Google-Attributes: gid1108a1,public
X-Google-Thread: 103376,583275b6950bf4e6
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-05-01 08:54:00 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newspeer.monmouth.com!newsfeed!nntp.TheWorld.com!not-for-mail
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Newsgroups: comp.lang.java.advocacy,comp.object,comp.lang.ada
Subject: Re: Using Ada for device drivers? (Was: the Ada mandate,
 and why it collapsed and died)
Date: 01 May 2003 11:53:57 -0400
Organization: The World Public Access UNIX, Brookline, MA
Message-ID: <wccfznyek8a.fsf@shell01.TheWorld.com>
References: <9fa75d42.0304230424.10612b1a@posting.google.com>
 <4a885870.0304291909.300765f@posting.google.com>
 <416273D61ACF7FEF.82C1D1AC17296926.FF0BFD4934A03813@lp.airnews.net>
 <4a885870.0304300431.49a61bfa@posting.google.com>
 <fhm6o-3u2.ln1@beastie.ix.netcom.com>
NNTP-Posting-Host: shell01.theworld.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: pcls4.std.com 1051804439 25267 199.172.62.241 (1 May 2003 15:53:59
 GMT)
X-Complaints-To: abuse@TheWorld.com
NNTP-Posting-Date: Thu, 1 May 2003 15:53:59 +0000 (UTC)
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2
Xref: archiver1.google.com comp.lang.java.advocacy:62984 comp.object:62473
 comp.lang.ada:36812
Date: 2003-05-01T11:53:57-04:00
List-Id: <comp.lang.ada>

Dennis Lee Bieber <wlfraed@ix.netcom.com> writes:

> Will fed this fish to the penguins on Wednesday 30 April 2003 05:31 am:
> 
> > Now if you want a challenge try to write an Ada chess program to beat
> > GNU chess. It's all C.
> 
>         I presume you mean to black-box the development -- after all, it is 
> the /algorithms/ which make or break a chess program. Those algorithms 
> can be implemented in any language (though speed of execution may be 
> rather poor if one were to implement it in TCL <G>).

And the same exact algorithm running faster will play better chess,
since chess is a timed game.

- Bob