Gecko [ nbspublicschool.com ]

Name	Size	Permission
package	[ DIR ]	drwxr-xr-x
Makefile.in	4.92 KB	-rw-r--r--
README	35.89 KB	-rw-r--r--
aclocal.m4	108.83 KB	-rw-r--r--
background.c	6.84 KB	-rw-r--r--
blue.c	12.4 KB	-rw-r--r--
bs.6	3.91 KB	-rw-r--r--
bs.c	29.95 KB	-rw-r--r--
bulgarian-utf8.txt	340 B	-rw-r--r--
cardfile.c	13.26 KB	-rw-r--r--
cardfile.dat	394 B	-rw-r--r--
chgat.c	9.03 KB	-rw-r--r--
clip_printw.c	9.1 KB	-rw-r--r--
color_name.h	3.32 KB	-rw-r--r--
color_set.c	3.25 KB	-rw-r--r--
configure	449.42 KB	-rw-r--r--
configure.in	9.57 KB	-rw-r--r--
demo_altkeys.c	4.77 KB	-rw-r--r--
demo_defkey.c	7.4 KB	-rw-r--r--
demo_forms.c	13.01 KB	-rw-r--r--
demo_keyok.c	3.24 KB	-rw-r--r--
demo_menus.c	18.74 KB	-rw-r--r--
demo_panels.c	16.89 KB	-rw-r--r--
demo_termcap.c	10.09 KB	-rw-r--r--
demo_terminfo.c	10.05 KB	-rw-r--r--
ditto.c	11.04 KB	-rw-r--r--
dots.c	4.52 KB	-rw-r--r--
dots_mvcur.c	4.66 KB	-rw-r--r--
echochar.c	4.35 KB	-rw-r--r--
edit_field.c	11.21 KB	-rw-r--r--
edit_field.h	2.57 KB	-rw-r--r--
filter.c	4.97 KB	-rw-r--r--
firework.c	5.53 KB	-rw-r--r--
firstlast.c	3.72 KB	-rw-r--r--
foldkeys.c	7.44 KB	-rw-r--r--
gdc.6	3.03 KB	-rw-r--r--
gdc.c	8.74 KB	-rw-r--r--
hanoi.c	8.58 KB	-rw-r--r--
hashtest.c	6.58 KB	-rw-r--r--
inch_wide.c	7.21 KB	-rw-r--r--
inchs.c	7.15 KB	-rw-r--r--
ins_wide.c	12.25 KB	-rw-r--r--
insdelln.c	9.16 KB	-rw-r--r--
inserts.c	10.62 KB	-rw-r--r--
install-sh	6.96 KB	-rw-r--r--
key_names.c	3.22 KB	-rw-r--r--
keynames.c	3.07 KB	-rw-r--r--
knight.c	18.54 KB	-rw-r--r--
linedata.h	3.16 KB	-rw-r--r--
linux-color.dat	2.56 KB	-rw-r--r--
listused.sh	5.46 KB	-rw-r--r--
lrtest.c	5.24 KB	-rw-r--r--
make-tar.sh	4.8 KB	-rw-r--r--
mk-test.awk	4.42 KB	-rw-r--r--
modules	5.07 KB	-rw-r--r--
movewindow.c	16.44 KB	-rw-r--r--
ncurses.c	154.98 KB	-rw-r--r--
ncurses_tst.hin	2.88 KB	-rw-r--r--
newdemo.c	7.38 KB	-rw-r--r--
programs	5.28 KB	-rw-r--r--
railroad.c	5.66 KB	-rw-r--r--
rain.c	8.44 KB	-rw-r--r--
redraw.c	4.66 KB	-rw-r--r--
savescreen.c	7.49 KB	-rw-r--r--
savescreen.sh	2.66 KB	-rw-r--r--
tclock.c	5.26 KB	-rw-r--r--
test.priv.h	19.55 KB	-rw-r--r--
test_add_wchstr.c	14.08 KB	-rw-r--r--
test_addchstr.c	12.14 KB	-rw-r--r--
test_addstr.c	10.3 KB	-rw-r--r--
test_addwstr.c	12.37 KB	-rw-r--r--
test_arrays.c	3.83 KB	-rw-r--r--
test_get_wstr.c	8.94 KB	-rw-r--r--
test_getstr.c	8.88 KB	-rw-r--r--
test_instr.c	6.49 KB	-rw-r--r--
test_inwstr.c	6.69 KB	-rw-r--r--
test_opaque.c	10.42 KB	-rw-r--r--
test_vid_puts.c	3.97 KB	-rw-r--r--
test_vidputs.c	3.92 KB	-rw-r--r--
testaddch.c	3.46 KB	-rw-r--r--
testcurs.c	16.69 KB	-rw-r--r--
testscanw.c	2.88 KB	-rw-r--r--
tracemunch	5.01 KB	-rw-r--r--
view.c	13.84 KB	-rw-r--r--
widechars-utf8.txt	389 B	-rw-r--r--
widechars.h	3.19 KB	-rw-r--r--
worm.c	14.01 KB	-rw-r--r--
xmas.c	33.47 KB	-rw-r--r--
xterm-16color.dat	2.99 KB	-rw-r--r--
xterm-256color.dat	6.88 KB	-rw-r--r--
xterm-88color.dat	4.11 KB	-rw-r--r--

Code Editor : hanoi.c

/****************************************************************************
 * Copyright (c) 1998-2010,2012 Free Software Foundation, Inc.              *
 *                                                                          *
 * Permission is hereby granted, free of charge, to any person obtaining a  *
 * copy of this software and associated documentation files (the            *
 * "Software"), to deal in the Software without restriction, including      *
 * without limitation the rights to use, copy, modify, merge, publish,      *
 * distribute, distribute with modifications, sublicense, and/or sell       *
 * copies of the Software, and to permit persons to whom the Software is    *
 * furnished to do so, subject to the following conditions:                 *
 *                                                                          *
 * The above copyright notice and this permission notice shall be included  *
 * in all copies or substantial portions of the Software.                   *
 *                                                                          *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
 * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
 *                                                                          *
 * Except as contained in this notice, the name(s) of the above copyright   *
 * holders shall not be used in advertising or otherwise to promote the     *
 * sale, use or other dealings in this Software without prior written       *
 * authorization.                                                           *
 ****************************************************************************/
/*
 *	Name: Towers of Hanoi.
 *
 *	Desc:
 *		This is a playable copy of towers of hanoi.
 *		Its sole purpose is to demonstrate my Amiga Curses package.
 *		This program should compile on any system that has Curses.
 *		'hanoi'		will give a manual game with 7 playing pieces.
 *		'hanoi n'	will give a manual game with n playing pieces.
 *		'hanoi n a' will give an auto solved game with n playing pieces.
 *
 *	Author: Simon J Raybould	(sie@fulcrum.bt.co.uk).
 * 	(This version has been slightly modified by the ncurses maintainers.)
 *
 *	Date: 05.Nov.90
 *
 * $Id: hanoi.c,v 1.34 2012/12/08 16:41:56 tom Exp $
 */

#include <test.priv.h>
#include <math.h>

#define NPEGS			3	/* This is not configurable !! */
#define MINTILES		3
#define MAXTILES		9
#define DEFAULTTILES		7
#define TOPLINE			6
#define BASELINE		16
#define STATUSLINE		(LINES-3)
#define LEFTPEG			19
#define MIDPEG			39
#define RIGHTPEG		59

#define LENTOIND(x)		(((int)(x)-1)/2)
#define OTHER(a,b)		(3-((a)+(b)))

struct Peg {
    size_t Length[MAXTILES];
    int Count;
};

static struct Peg Pegs[NPEGS];
static int PegPos[] =
{
    LEFTPEG,
    MIDPEG,
    RIGHTPEG
};
static short TileColour[] =
{
    COLOR_GREEN,		/* Length 3 */
    COLOR_MAGENTA,		/* Length 5 */
    COLOR_RED,			/* Length 7 */
    COLOR_BLUE,			/* Length 9 */
    COLOR_CYAN,			/* Length 11 */
    COLOR_YELLOW,		/* Length 13 */
    COLOR_GREEN,		/* Length 15 */
    COLOR_MAGENTA,		/* Length 17 */
    COLOR_RED,			/* Length 19 */
};
static int NTiles = 0;
static int NMoves = 0;
static bool AutoFlag = FALSE;

static void InitTiles(void);
static void DisplayTiles(void);
static void MakeMove(int From, int To);
static void AutoMove(int From, int To, int Num);
static void Usage(void);
static int Solved(int NumTiles);
static int GetMove(int *From, int *To);
static int InvalidMove(int From, int To);

int
main(int argc, char **argv)
{
    int FromCol, ToCol;

setlocale(LC_ALL, "");

switch (argc) {
    case 1:
	NTiles = DEFAULTTILES;
	break;
    case 2:
	NTiles = atoi(argv[1]);
	if (NTiles > MAXTILES || NTiles < MINTILES) {
	    fprintf(stderr, "Range %d to %d\n", MINTILES, MAXTILES);
	    ExitProgram(EXIT_FAILURE);
	}
	break;
    case 3:
	if (strcmp(argv[2], "a")) {
	    Usage();
	    ExitProgram(EXIT_FAILURE);
	}
	NTiles = atoi(argv[1]);
	if (NTiles > MAXTILES || NTiles < MINTILES) {
	    fprintf(stderr, "Range %d to %d\n", MINTILES, MAXTILES);
	    ExitProgram(EXIT_FAILURE);
	}
	AutoFlag = TRUE;
	break;
    default:
	Usage();
	ExitProgram(EXIT_FAILURE);
    }
    initscr();
    if (has_colors()) {
	int i;
	short bg = COLOR_BLACK;
	start_color();
#if HAVE_USE_DEFAULT_COLORS
	if (use_default_colors() == OK)
	    bg = -1;
#endif
	for (i = 0; i < 9; i++)
	    init_pair((short) (i + 1), bg, TileColour[i]);
    }
    cbreak();
    if (LINES < 24) {
	endwin();
	fprintf(stderr, "Min screen length 24 lines\n");
	ExitProgram(EXIT_FAILURE);
    }
    if (AutoFlag) {
	curs_set(0);
	leaveok(stdscr, TRUE);	/* Attempt to remove cursor */
    }
    InitTiles();
    DisplayTiles();
    if (AutoFlag) {
	do {
	    noecho();
	    AutoMove(0, 2, NTiles);
	} while (!Solved(NTiles));
	sleep(2);
    } else {
	echo();
	for (;;) {
	    if (GetMove(&FromCol, &ToCol))
		break;
	    if (InvalidMove(FromCol, ToCol)) {
		MvAddStr(STATUSLINE, 0, "Invalid Move !!");
		refresh();
		beep();
		continue;
	    }
	    MakeMove(FromCol, ToCol);
	    if (Solved(NTiles)) {
		MvPrintw(STATUSLINE, 0,
			 "Well Done !! You did it in %d moves", NMoves);
		refresh();
		sleep(5);
		break;
	    }
	}
    }
    endwin();
    ExitProgram(EXIT_SUCCESS);
}

static int
InvalidMove(int From, int To)
{
    if (From >= NPEGS)
	return TRUE;
    if (From < 0)
	return TRUE;
    if (To >= NPEGS)
	return TRUE;
    if (To < 0)
	return TRUE;
    if (From == To)
	return TRUE;
    if (!Pegs[From].Count)
	return TRUE;
    if (Pegs[To].Count &&
	Pegs[From].Length[Pegs[From].Count - 1] >
	Pegs[To].Length[Pegs[To].Count - 1])
	return TRUE;
    return FALSE;
}

static void
InitTiles(void)
{
    int Size, SlotNo;

for (Size = NTiles * 2 + 1, SlotNo = 0; Size >= 3; Size -= 2)
	Pegs[0].Length[SlotNo++] = (size_t) Size;

Pegs[0].Count = NTiles;
    Pegs[1].Count = 0;
    Pegs[2].Count = 0;
}

static void
DisplayTiles(void)
{
    int Line, peg, SlotNo;
    char TileBuf[BUFSIZ];

erase();
    MvAddStr(1, 24, "T O W E R S   O F   H A N O I");
    MvAddStr(3, 34, "SJR 1990");
    MvPrintw(19, 5, "Moves : %d of %.0f", NMoves, pow(2.0, NTiles) - 1);
    (void) attrset(A_REVERSE);
    MvAddStr(BASELINE, 8,
	     "                                                               ");

for (Line = TOPLINE; Line < BASELINE; Line++) {
	MvAddCh(Line, LEFTPEG, ' ');
	MvAddCh(Line, MIDPEG, ' ');
	MvAddCh(Line, RIGHTPEG, ' ');
    }
    MvAddCh(BASELINE, LEFTPEG, '1');
    MvAddCh(BASELINE, MIDPEG, '2');
    MvAddCh(BASELINE, RIGHTPEG, '3');
    (void) attrset(A_NORMAL);

/* Draw tiles */
    for (peg = 0; peg < NPEGS; peg++) {
	for (SlotNo = 0; SlotNo < Pegs[peg].Count; SlotNo++) {
	    size_t len = Pegs[peg].Length[SlotNo];
	    if (len < sizeof(TileBuf) - 1 && len < (size_t) PegPos[peg]) {
		memset(TileBuf, ' ', len);
		TileBuf[len] = '\0';
		if (has_colors())
		    (void) attrset((attr_t) COLOR_PAIR(LENTOIND(len)));
		else
		    (void) attrset(A_REVERSE);
		MvAddStr(BASELINE - (SlotNo + 1),
			 (PegPos[peg] - (int) len / 2),
			 TileBuf);
	    }
	}
    }
    (void) attrset(A_NORMAL);
    refresh();
}

static int
GetMove(int *From, int *To)
{
    MvAddStr(STATUSLINE, 0, "Next move ('q' to quit) from ");
    clrtoeol();
    refresh();
    if ((*From = getch()) == 'q')
	return TRUE;
    *From -= ('0' + 1);
    addstr(" to ");
    clrtoeol();
    refresh();

if ((*To = getch()) == 'q')
	return TRUE;
    *To -= ('0' + 1);
    refresh();
    if (!AutoFlag)
	napms(500);

move(STATUSLINE, 0);
    clrtoeol();
    refresh();
    return FALSE;
}

static void
MakeMove(int From, int To)
{
    Pegs[From].Count--;
    Pegs[To].Length[Pegs[To].Count] = Pegs[From].Length[Pegs[From].Count];
    Pegs[To].Count++;
    NMoves++;
    DisplayTiles();
}

static void
AutoMove(int From, int To, int Num)
{
    if (Num == 1) {
	MakeMove(From, To);
	napms(500);
    } else {
	AutoMove(From, OTHER(From, To), Num - 1);
	MakeMove(From, To);
	napms(500);
	AutoMove(OTHER(From, To), To, Num - 1);
    }
}

static int
Solved(int NumTiles)
{
    int i;

for (i = 1; i < NPEGS; i++)
	if (Pegs[i].Count == NumTiles)
	    return TRUE;
    return FALSE;
}

static void
Usage(void)
{
    fprintf(stderr, "Usage: hanoi [<No Of Tiles>] [a]\n");
    fprintf(stderr,
	    "The 'a' option causes the tower to be solved automatically\n");
}

${this.title}

Code Editor : hanoi.c