1.\" $NetBSD: tetris.6,v 1.9 2002/09/26 18:32:05 wiz Exp $ 2.\" 3.\" Copyright (c) 1992, 1993 4.\" The Regents of the University of California. All rights reserved. 5.\" 6.\" This code is derived from software contributed to Berkeley by 7.\" Nancy L. Tinkham and Darren F. Provine. 8.\" 9.\" Redistribution and use in source and binary forms, with or without 10.\" modification, are permitted provided that the following conditions 11.\" are met: 12.\" 1. Redistributions of source code must retain the above copyright 13.\" notice, this list of conditions and the following disclaimer. 14.\" 2. Redistributions in binary form must reproduce the above copyright 15.\" notice, this list of conditions and the following disclaimer in the 16.\" documentation and/or other materials provided with the distribution. 17.\" 3. All advertising materials mentioning features or use of this software 18.\" must display the following acknowledgement: 19.\" This product includes software developed by the University of 20.\" California, Berkeley and its contributors. 21.\" 4. Neither the name of the University nor the names of its contributors 22.\" may be used to endorse or promote products derived from this software 23.\" without specific prior written permission. 24.\" 25.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35.\" SUCH DAMAGE. 36.\" 37.\" @(#)tetris.6 8.1 (Berkeley) 5/31/93 38.\" 39.Dd May 31, 1993 40.Dt TETRIS 6 41.Os 42.Sh NAME 43.Nm tetris 44.Nd the game of tetris 45.Sh SYNOPSIS 46.Nm 47.Op Fl ps 48.Op Fl k Ar keys 49.Op Fl l Ar level 50.Sh DESCRIPTION 51The 52.Nm 53command runs display-based game which must be played on a CRT terminal. 54The object is to fit the shapes together forming complete rows, 55which then vanish. 56When the shapes fill up to the top, the game ends. 57You can optionally select a level of play, or custom-select control keys. 58.Pp 59The default level of play is 2. 60.Pp 61The default control keys are as follows: 62.Pp 63.Bl -tag -width "xxspacexx" -compact -offset indent 64.It j 65move left 66.It k 67rotate 1/4 turn counterclockwise 68.It l 69move right 70.It Aq space 71drop 72.It p 73pause 74.It q 75quit 76.El 77.Pp 78The options are as follows: 79.Bl -tag -width indent 80.It Fl k 81The default control keys can be changed using the 82.Fl k 83option. 84The 85.Ar keys 86argument must have the six keys in order, and, remember to quote any 87space or tab characters from the shell. 88For example: 89.sp 90.Dl "tetris -l 2 -k 'jkl pq'" 91.sp 92will play the default games, i.e. level 2 and with the default 93control keys. 94The current key settings are displayed at the bottom of the screen 95during play. 96.It Fl l 97Select a level of play. 98.It Fl s 99Display the top scores. 100.It Fl p 101Switch on previewing of the shape that will appear next. 102.El 103.Pp 104.Sh PLAY 105At the start of the game, a shape will appear at the top of the screen, 106falling one square at a time. 107The speed at which it falls is determined directly by the level: 108if you select level 2, the blocks will fall twice per second; 109at level 9, they fall 9 times per second. 110(As the game goes on, things speed up, 111no matter what your initial selection.) 112When this shape 113.Dq touches down 114on the bottom of the field, another will appear at the top. 115.Pp 116You can move shapes to the left or right, rotate them counterclockwise, 117or drop them to the bottom by pressing the appropriate keys. 118As you fit them together, completed horizontal rows vanish, 119and any blocks above fall down to fill in. 120When the blocks stack up to the top of the screen, the game is over. 121.Sh SCORING 122You get one point for every block you fit into the stack, 123and one point for every space a block falls when you hit the drop key. 124(Dropping the blocks is therefore a good way to increase your score.) 125Your total score is the product of the level of play 126and your accumulated 127.ie t points\(em200 128.el points -- 200 129points on level 3 gives you a score of 600. 130Each player gets at most one entry on any level, 131for a total of nine scores in the high scores file. 132Players who no longer have accounts are limited to one score. 133Also, scores over 5 years old are expired. 134The exception to these conditions is that the highest score on a given 135level is 136.Em always 137kept, 138so that following generations can pay homage to those who have 139wasted serious amounts of time. 140.Pp 141The score list is produced at the end of the game. 142The printout includes each player's overall ranking, 143name, score, and how many points were scored on what level. 144Scores which are the highest on a given level 145are marked with asterisks 146.Dq * . 147.Sh FILES 148.Bl -tag -width /var/games/tetris.scoresxx 149.It /var/games/tetris.scores 150high score file 151.El 152.Sh BUGS 153The higher levels are unplayable without a fast terminal connection. 154.Sh AUTHORS 155Adapted from a 1989 International Obfuscated C Code Contest winner by 156Chris Torek and Darren F. Provine. 157.Pp 158Manual adapted from the original entry written by Nancy L. Tinkham and 159Darren F. Provine. 160.Pp 161Code for previewing next shape added by Hubert Feyrer in 1999. 162