Here is the original announcement for the game.  It might not make much sense
without it:

Newsgroups: rec.arts.int-fiction
From: Joe Mason <joe@notcharles.ca>
Subject: [ANNOUNCE] Annoyotron IV: Affrontotron
References: <68bd0e8.0402122053.50da0b11@posting.google.com>
<403bf1c3.21424792@news.eircom.net>
<witness-392BD2.03225325022004@news.t-online.com>
<403c48ff.43760128@news.eircom.net> <c1jecs$5cu$1@news.fsf.net>
<48d%b.34$OB.184@news.oracle.com> <c1jn0i$q07$1@reader2.panix.com>
<c1ljm4$dt4$1@news.doit.wisc.edu> <jTs%b.29$we5.201@news.oracle.com>
Message-Id: <slrnc3ssjb.mcf.joe@gate.notcharles.ca>
User-Agent: slrn/0.9.7.4 (Linux)
Lines: 19
Date: Thu, 26 Feb 2004 22:52:51 GMT
NNTP-Posting-Host: 67.68.197.155
X-Complaints-To: abuse@sympatico.ca
X-Trace: news20.bellglobal.com 1077835971 67.68.197.155 (Thu, 26 Feb 2004
17:52:51 EST)
NNTP-Posting-Date: Thu, 26 Feb 2004 17:52:51 EST
Organization: Bell Sympatico


In article <jTs%b.29$we5.201@news.oracle.com>, Mike Roberts wrote:
> This actually has practical applicability to IF, too.  You could imagine a
> game where the winning conclusion is reached by typing GO NORTH 1,000,001
> times in a row, and every time but the 1,000,001st, the response to GO NORTH
> is "You can't go that way."  (It wouldn't be a very fun game, but it's still
> a possible game.)  If an automated winnability evaluator were given a limit
> of a million turns, it would incorrectly call the state unwinnable.

*** Annoyotron IV: Affrontotron ***

has just been uploaded to the incomig directory of an IF-Archive mirror
near you!  Either I've implemented the game Mike describes above... or I
haven't!  Is it winable?  You decide!

Watch for it in if-archive/unprocessed soon...

(No fair decompiling it - that's cheating!)

Joe
