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: 103376,1192c1137d7a2b6
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-01-06 18:13:48 PST
Path: 
 supernews.google.com!sn-xit-02!supernews.com!news.tele.dk!194.176.220.130!newsfeed.icl.net!newspeer.clara.net!news.clara.net!news.vas-net.net!server2.netnews.ja.net!newshost.central.susx.ac.uk!news.bton.ac.uk!not-for-mail
From: John English <je@brighton.ac.uk>
Newsgroups: comp.lang.ada
Subject: Re: I need advice please on this Ada95 hangman game
Date: Sun, 07 Jan 2001 01:16:46 +0000
Organization: University of Brighton
Message-ID: <3A57C37E.A6D57CE9@brighton.ac.uk>
References: <t4s3dn60cip62b@corp.supernews.co.uk>
NNTP-Posting-Host: dialin-b6.bton.ac.uk
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Trace: saturn.bton.ac.uk 978829780 22793 194.81.199.186 (7 Jan 2001 01:09:40
 GMT)
X-Complaints-To: news@bton.ac.uk
NNTP-Posting-Date: 7 Jan 2001 01:09:40 GMT
X-Mailer: Mozilla 4.6 [en] (Win95; I)
X-Accept-Language: en,pdf
Xref: supernews.google.com comp.lang.ada:3730
Date: 2001-01-07T01:09:40+00:00
List-Id: <comp.lang.ada>

Mark Pagdin wrote:
> I hope you had a nice Christmas! I am looking for your help and advice. I am
> a student at university in England

... Brighton possibly? :-)

> and have just started learning to use Ada
> 95. This is my first programming language and obviously I am finding it hard
> to learn it. However I have been set a project to create a program to play
> hangman (a word game).
> 
> I have been working hard to create this and am slowly getting there. However
> I am stuck on the main procedure which searches for the letter in the hidden
> word and then display any correct letters.
> 
> Here is the output I get when i run the program (the word is revealed at the
> moment for testing purposes):
> 
> Enter a word to test the Hangman game
> mark2
> Enter a Leter
> m
> m_ _ _ _ Enter a Leter
> a
> _ a_ _ _ Enter a Leter
> r
> _ _ r_ _ Enter a Leter
> k
> _ _ _ k_ Enter a Leter
> 2
> _ _ _ _ 2Enter a Leter
> 
> Please would it be possible for anyone to point out a way of storing each
> attempt so that when the player attempts to guess again the program is able
> to store the result from the previous guess.

You'll need to post your code (or drop in to my office next week) to
be able to figure this out; you're obviously close to a working
solution,
if that's any consolation...

-----------------------------------------------------------------
 John English              | mailto:je@brighton.ac.uk
 Senior Lecturer           | http://www.comp.it.bton.ac.uk/je
 Dept. of Computing        | ** NON-PROFIT CD FOR CS STUDENTS **
 University of Brighton    |    -- see http://burks.bton.ac.uk
-----------------------------------------------------------------