Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!portc02.blue.aol.com!portc01.blue.aol.com!news-peer.gsl.net!news.gsl.net!usenet.eel.ufl.edu!warwick!bradford.ac.uk!leeds.ac.uk!news
From: csxgti@scs.leeds.ac.uk (G T Irwin)
Subject: Re: Tetris
Message-ID: <1996Nov25.112800.4173@leeds.ac.uk>
NNTP-Posting-Host: csgi45.leeds.ac.uk
Organization: The University of Leeds, School of Computer Studies
Date: Mon, 25 Nov 1996 11:28:00 +0000 (GMT)
References: <56e636$i3@news1.mnsinc.com><56eb9i$rnl@nef.ens.fr>
    <1996Nov18.135616.14531@leeds.ac.uk>
    <01bbd650$922beaa0$886c4fce@KMEISSNER.activision.com>
Lines: 16

In article <01bbd650$922beaa0$886c4fce@KMEISSNER.activision.com>, "Karl Meissner" <kmeissner@activision.com> writes 
>
> Assume you only have 4 operators, move left, move right, rotate, and drop. 
> 
> Each of the first three operators moves the piece down one level.

It`s not quite that simple since can move left,right then left again before the
sahpe falls down another row. This makes the search tree enormous, and produces
hundreds, possibly thousands of routes from the start state to the goal state.

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