Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!cam-news-feed3.bbnplanet.com!cam-news-hub1.bbnplanet.com!news.bbnplanet.com!news.mathworks.com!rill.news.pipex.net!pipex!uknet!usenet1.news.uk.psi.net!uknet!uknet!newsfeed.ed.ac.uk!leeds.ac.uk!news
From: csxgti@scs.leeds.ac.uk (G T Irwin)
Subject: Tetris Proof
Message-ID: <1997Feb20.234022.7086@leeds.ac.uk>
NNTP-Posting-Host: csgi34.leeds.ac.uk
Organization: The University of Leeds, School of Computer Studies
Date: Thu, 20 Feb 1997 23:40:21 +0000 (GMT)
Lines: 11

A while ago someone posted an article mentioning that they had found a proof
that a tetris game with only z or s shaped pieces is bound to fail. Does anyone
know where this proof is?


-- 
-----------
Greg Irwin                    
                                 
e-mail : csxgti@scs.leeds.ac.uk  
         csc4gti@sgi.leeds.ac.uk 
