2006-12-18 12:32:42 +08:00
|
|
|
/****************************************************************************
|
2010-05-02 08:59:02 +08:00
|
|
|
* Copyright (c) 1998-2009,2010 Free Software Foundation, Inc. *
|
2006-12-18 12:32:42 +08:00
|
|
|
* *
|
|
|
|
* 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. *
|
|
|
|
****************************************************************************/
|
1997-05-15 12:00:00 +08:00
|
|
|
/*
|
|
|
|
* 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
|
|
|
|
*
|
2010-11-14 09:43:00 +08:00
|
|
|
* $Id: hanoi.c,v 1.31 2010/11/14 01:01:07 tom Exp $
|
1997-05-15 12:00:00 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <test.priv.h>
|
|
|
|
|
|
|
|
#define NPEGS 3 /* This is not configurable !! */
|
|
|
|
#define MINTILES 3
|
|
|
|
#define MAXTILES 9
|
2002-10-13 11:35:53 +08:00
|
|
|
#define DEFAULTTILES 7
|
1997-05-15 12:00:00 +08:00
|
|
|
#define TOPLINE 6
|
|
|
|
#define BASELINE 16
|
|
|
|
#define STATUSLINE (LINES-3)
|
|
|
|
#define LEFTPEG 19
|
|
|
|
#define MIDPEG 39
|
|
|
|
#define RIGHTPEG 59
|
|
|
|
|
|
|
|
#define LENTOIND(x) (((x)-1)/2)
|
|
|
|
#define OTHER(a,b) (3-((a)+(b)))
|
|
|
|
|
|
|
|
struct Peg {
|
2000-10-21 12:42:11 +08:00
|
|
|
size_t Length[MAXTILES];
|
|
|
|
int Count;
|
1997-05-15 12:00:00 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct Peg Pegs[NPEGS];
|
2000-10-21 12:42:11 +08:00
|
|
|
static int PegPos[] =
|
2010-11-14 09:43:00 +08:00
|
|
|
{
|
|
|
|
LEFTPEG,
|
|
|
|
MIDPEG,
|
|
|
|
RIGHTPEG
|
|
|
|
};
|
|
|
|
static short TileColour[] =
|
2000-10-21 12:42:11 +08:00
|
|
|
{
|
|
|
|
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 */
|
1997-05-15 12:00:00 +08:00
|
|
|
};
|
|
|
|
static int NMoves = 0;
|
2008-08-05 09:06:16 +08:00
|
|
|
static bool AutoFlag = FALSE;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
|
|
|
static void InitTiles(int NTiles);
|
|
|
|
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)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
int NTiles, FromCol, ToCol;
|
2002-10-13 11:35:53 +08:00
|
|
|
|
|
|
|
setlocale(LC_ALL, "");
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
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);
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
if (strcmp(argv[2], "a")) {
|
|
|
|
Usage();
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-10-21 12:42:11 +08:00
|
|
|
NTiles = atoi(argv[1]);
|
|
|
|
if (NTiles > MAXTILES || NTiles < MINTILES) {
|
|
|
|
fprintf(stderr, "Range %d to %d\n", MINTILES, MAXTILES);
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
|
|
|
AutoFlag = TRUE;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
Usage();
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
2000-07-09 10:46:08 +08:00
|
|
|
#ifdef TRACE
|
2000-10-21 12:42:11 +08:00
|
|
|
trace(TRACE_MAXIMUM);
|
1997-05-15 12:00:00 +08:00
|
|
|
#endif
|
2000-10-21 12:42:11 +08:00
|
|
|
initscr();
|
|
|
|
if (has_colors()) {
|
|
|
|
int i;
|
2010-11-14 09:43:00 +08:00
|
|
|
short bg = COLOR_BLACK;
|
2000-10-21 12:42:11 +08:00
|
|
|
start_color();
|
|
|
|
#if HAVE_USE_DEFAULT_COLORS
|
|
|
|
if (use_default_colors() == OK)
|
|
|
|
bg = -1;
|
1997-05-15 12:00:00 +08:00
|
|
|
#endif
|
2000-10-21 12:42:11 +08:00
|
|
|
for (i = 0; i < 9; i++)
|
2010-11-14 09:43:00 +08:00
|
|
|
init_pair((short) (i + 1), bg, TileColour[i]);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
|
|
|
cbreak();
|
|
|
|
if (LINES < 24) {
|
1997-05-15 12:00:00 +08:00
|
|
|
endwin();
|
2000-10-21 12:42:11 +08:00
|
|
|
fprintf(stderr, "Min screen length 24 lines\n");
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_FAILURE);
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
|
|
|
if (AutoFlag) {
|
|
|
|
curs_set(0);
|
|
|
|
leaveok(stdscr, TRUE); /* Attempt to remove cursor */
|
|
|
|
}
|
|
|
|
InitTiles(NTiles);
|
|
|
|
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)) {
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddStr(STATUSLINE, 0, "Invalid Move !!");
|
2000-10-21 12:42:11 +08:00
|
|
|
refresh();
|
|
|
|
beep();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
MakeMove(FromCol, ToCol);
|
|
|
|
if (Solved(NTiles)) {
|
2010-05-02 08:59:02 +08:00
|
|
|
MvPrintw(STATUSLINE, 0,
|
2000-10-21 12:42:11 +08:00
|
|
|
"Well Done !! You did it in %d moves", NMoves);
|
|
|
|
refresh();
|
|
|
|
sleep(5);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
endwin();
|
2002-10-13 11:35:53 +08:00
|
|
|
ExitProgram(EXIT_SUCCESS);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
InvalidMove(int From, int To)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
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;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
InitTiles(int NTiles)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
int Size, SlotNo;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
for (Size = NTiles * 2 + 1, SlotNo = 0; Size >= 3; Size -= 2)
|
2010-11-14 09:43:00 +08:00
|
|
|
Pegs[0].Length[SlotNo++] = (size_t) Size;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
Pegs[0].Count = NTiles;
|
|
|
|
Pegs[1].Count = 0;
|
|
|
|
Pegs[2].Count = 0;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
DisplayTiles(void)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
int Line, peg, SlotNo;
|
|
|
|
char TileBuf[BUFSIZ];
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
erase();
|
2010-05-02 08:59:02 +08:00
|
|
|
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", NMoves);
|
2009-08-30 06:41:54 +08:00
|
|
|
(void) attrset(A_REVERSE);
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddStr(BASELINE, 8,
|
2000-10-21 12:42:11 +08:00
|
|
|
" ");
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
for (Line = TOPLINE; Line < BASELINE; Line++) {
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddCh(Line, LEFTPEG, ' ');
|
|
|
|
MvAddCh(Line, MIDPEG, ' ');
|
|
|
|
MvAddCh(Line, RIGHTPEG, ' ');
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddCh(BASELINE, LEFTPEG, '1');
|
|
|
|
MvAddCh(BASELINE, MIDPEG, '2');
|
|
|
|
MvAddCh(BASELINE, RIGHTPEG, '3');
|
2009-08-30 06:41:54 +08:00
|
|
|
(void) attrset(A_NORMAL);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
/* Draw tiles */
|
|
|
|
for (peg = 0; peg < NPEGS; peg++) {
|
|
|
|
for (SlotNo = 0; SlotNo < Pegs[peg].Count; SlotNo++) {
|
2010-11-14 09:43:00 +08:00
|
|
|
size_t len = Pegs[peg].Length[SlotNo];
|
|
|
|
if (len < sizeof(TileBuf) - 1 && len < (size_t) PegPos[peg]) {
|
2008-08-05 09:06:16 +08:00
|
|
|
memset(TileBuf, ' ', len);
|
|
|
|
TileBuf[len] = '\0';
|
|
|
|
if (has_colors())
|
2009-08-30 06:41:54 +08:00
|
|
|
(void) attrset(COLOR_PAIR(LENTOIND(len)));
|
2008-08-05 09:06:16 +08:00
|
|
|
else
|
2009-08-30 06:41:54 +08:00
|
|
|
(void) attrset(A_REVERSE);
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddStr(BASELINE - (SlotNo + 1),
|
2010-11-14 09:43:00 +08:00
|
|
|
(PegPos[peg] - (int) len / 2),
|
2008-08-05 09:06:16 +08:00
|
|
|
TileBuf);
|
|
|
|
}
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
2000-10-21 12:42:11 +08:00
|
|
|
}
|
2009-08-30 06:41:54 +08:00
|
|
|
(void) attrset(A_NORMAL);
|
2000-10-21 12:42:11 +08:00
|
|
|
refresh();
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
GetMove(int *From, int *To)
|
|
|
|
{
|
2010-05-02 08:59:02 +08:00
|
|
|
MvAddStr(STATUSLINE, 0, "Next move ('q' to quit) from ");
|
2000-10-21 12:42:11 +08:00
|
|
|
clrtoeol();
|
|
|
|
refresh();
|
|
|
|
if ((*From = getch()) == 'q')
|
|
|
|
return TRUE;
|
|
|
|
*From -= ('0' + 1);
|
|
|
|
addstr(" to ");
|
|
|
|
clrtoeol();
|
|
|
|
refresh();
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
if ((*To = getch()) == 'q')
|
|
|
|
return TRUE;
|
|
|
|
*To -= ('0' + 1);
|
|
|
|
refresh();
|
2008-08-05 09:06:16 +08:00
|
|
|
if (!AutoFlag)
|
|
|
|
napms(500);
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
move(STATUSLINE, 0);
|
|
|
|
clrtoeol();
|
|
|
|
refresh();
|
|
|
|
return FALSE;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
MakeMove(int From, int To)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
Pegs[From].Count--;
|
|
|
|
Pegs[To].Length[Pegs[To].Count] = Pegs[From].Length[Pegs[From].Count];
|
|
|
|
Pegs[To].Count++;
|
|
|
|
NMoves++;
|
|
|
|
DisplayTiles();
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
AutoMove(int From, int To, int Num)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
if (Num == 1) {
|
1997-05-15 12:00:00 +08:00
|
|
|
MakeMove(From, To);
|
|
|
|
napms(500);
|
2000-10-21 12:42:11 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
AutoMove(From, OTHER(From, To), Num - 1);
|
|
|
|
MakeMove(From, To);
|
|
|
|
napms(500);
|
|
|
|
AutoMove(OTHER(From, To), To, Num - 1);
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
Solved(int NumTiles)
|
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
int i;
|
1997-05-15 12:00:00 +08:00
|
|
|
|
2000-10-21 12:42:11 +08:00
|
|
|
for (i = 1; i < NPEGS; i++)
|
|
|
|
if (Pegs[i].Count == NumTiles)
|
|
|
|
return TRUE;
|
|
|
|
return FALSE;
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2002-10-13 11:35:53 +08:00
|
|
|
Usage(void)
|
1997-05-15 12:00:00 +08:00
|
|
|
{
|
2000-10-21 12:42:11 +08:00
|
|
|
fprintf(stderr, "Usage: hanoi [<No Of Tiles>] [a]\n");
|
|
|
|
fprintf(stderr,
|
|
|
|
"The 'a' option causes the tower to be solved automatically\n");
|
1997-05-15 12:00:00 +08:00
|
|
|
}
|