gomoku/stoc.c

   1 /*      $NetBSD: stoc.c,v 1.3 1997/01/03 01:35:31 cgd Exp $     */
   2
   3 /*
   4  * Copyright (c) 1994
   5  *      The Regents of the University of California.  All rights reserved.
   6  *
   7  * This code is derived from software contributed to Berkeley by
   8  * Ralph Campbell.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted provided that the following conditions
  12  * are met:
  13  * 1. Redistributions of source code must retain the above copyright
  14  *    notice, this list of conditions and the following disclaimer.
  15  * 2. Redistributions in binary form must reproduce the above copyright
  16  *    notice, this list of conditions and the following disclaimer in the
  17  *    documentation and/or other materials provided with the distribution.
  18  * 3. All advertising materials mentioning features or use of this software
  19  *    must display the following acknowledgement:
  20  *      This product includes software developed by the University of
  21  *      California, Berkeley and its contributors.
  22  * 4. Neither the name of the University nor the names of its contributors
  23  *    may be used to endorse or promote products derived from this software
  24  *    without specific prior written permission.
  25  *
  26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  36  * SUCH DAMAGE.
  37  */
  38
  39 #ifndef lint
  40 #if 0
  41 static char sccsid[] = "@(#)stoc.c      8.1 (Berkeley) 7/24/94";
  42 #else
  43 static char rcsid[] = "$NetBSD: stoc.c,v 1.3 1997/01/03 01:35:31 cgd Exp $";
  44 #endif
  45 #endif /* not lint */
  46
  47 #include "gomoku.h"
  48 #include <ctype.h>
  49
  50 char    *letters        = "<ABCDEFGHJKLMNOPQRST>";
  51
  52 struct mvstr {
  53         int     m_code;
  54         char    *m_text;
  55 };
  56 static  struct  mvstr   mv[] = {
  57         RESIGN,         "resign",
  58         RESIGN,         "quit",
  59         SAVE,           "save",
  60         -1,             0
  61 };
  62
  63 /*
  64  * Turn the spot number form of a move into the character form.
  65  */
  66 char *
  67 stoc(s)
  68         int s;
  69 {
  70         static char buf[32];
  71         register int i;
  72
  73         for (i = 0; mv[i].m_code >= 0; i++)
  74                 if (s == mv[i].m_code)
  75                         return(mv[i].m_text);
  76         sprintf(buf, "%c%d", letters[s % BSZ1], s / BSZ1);
  77         return(buf);
  78 }
  79
  80 /*
  81  * Turn the character form of a move into the spot number form.
  82  */
  83 ctos(mp)
  84         char *mp;
  85 {
  86         register int i;
  87
  88         for (i = 0; mv[i].m_code >= 0; i++)
  89                 if (strcmp(mp, mv[i].m_text) == 0)
  90                         return(mv[i].m_code);
  91         if (!isalpha(mp[0]))
  92                 return(ILLEGAL);
  93         i = atoi(&mp[1]);
  94         if (i < 1 || i > 19)
  95                 return(ILLEGAL);
  96         return(PT(lton(mp[0]), i));
  97 }
  98
  99 /*
 100  * Turn a letter into a number.
 101  */
 102 lton(c)
 103         int c;
 104 {
 105         register int i;
 106
 107         if (islower(c))
 108                 c = toupper(c);
 109         for (i = 1; i <= BSZ && letters[i] != c; i++)
 110                 ;
 111         return(i);
 112 }