1997-01-03 04:35:23 +03:00
|
|
|
/* $NetBSD: stoc.c,v 1.3 1997/01/03 01:35:31 cgd Exp $ */
|
|
|
|
|
1996-12-28 21:44:55 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1994
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Ralph Campbell.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
1996-12-28 21:56:57 +03:00
|
|
|
#if 0
|
1996-12-28 21:44:55 +03:00
|
|
|
static char sccsid[] = "@(#)stoc.c 8.1 (Berkeley) 7/24/94";
|
1996-12-28 21:56:57 +03:00
|
|
|
#else
|
1997-01-03 04:35:23 +03:00
|
|
|
static char rcsid[] = "$NetBSD: stoc.c,v 1.3 1997/01/03 01:35:31 cgd Exp $";
|
1996-12-28 21:56:57 +03:00
|
|
|
#endif
|
1996-12-28 21:44:55 +03:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#include "gomoku.h"
|
|
|
|
#include <ctype.h>
|
|
|
|
|
|
|
|
char *letters = "<ABCDEFGHJKLMNOPQRST>";
|
|
|
|
|
|
|
|
struct mvstr {
|
|
|
|
int m_code;
|
|
|
|
char *m_text;
|
|
|
|
};
|
|
|
|
static struct mvstr mv[] = {
|
|
|
|
RESIGN, "resign",
|
|
|
|
RESIGN, "quit",
|
|
|
|
SAVE, "save",
|
|
|
|
-1, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Turn the spot number form of a move into the character form.
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
stoc(s)
|
|
|
|
int s;
|
|
|
|
{
|
|
|
|
static char buf[32];
|
|
|
|
register int i;
|
|
|
|
|
|
|
|
for (i = 0; mv[i].m_code >= 0; i++)
|
|
|
|
if (s == mv[i].m_code)
|
|
|
|
return(mv[i].m_text);
|
|
|
|
sprintf(buf, "%c%d", letters[s % BSZ1], s / BSZ1);
|
|
|
|
return(buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Turn the character form of a move into the spot number form.
|
|
|
|
*/
|
|
|
|
ctos(mp)
|
|
|
|
char *mp;
|
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
|
|
|
|
for (i = 0; mv[i].m_code >= 0; i++)
|
|
|
|
if (strcmp(mp, mv[i].m_text) == 0)
|
|
|
|
return(mv[i].m_code);
|
|
|
|
if (!isalpha(mp[0]))
|
|
|
|
return(ILLEGAL);
|
|
|
|
i = atoi(&mp[1]);
|
|
|
|
if (i < 1 || i > 19)
|
|
|
|
return(ILLEGAL);
|
|
|
|
return(PT(lton(mp[0]), i));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Turn a letter into a number.
|
|
|
|
*/
|
|
|
|
lton(c)
|
|
|
|
int c;
|
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
|
|
|
|
if (islower(c))
|
|
|
|
c = toupper(c);
|
|
|
|
for (i = 1; i <= BSZ && letters[i] != c; i++)
|
|
|
|
;
|
|
|
|
return(i);
|
|
|
|
}
|