gomoku/stoc.c

   1 /*      $NetBSD: stoc.c,v 1.5 1999/09/08 21:17:50 jsm 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 #include <sys/cdefs.h>
  40 #ifndef lint
  41 #if 0
  42 static char sccsid[] = "@(#)stoc.c      8.1 (Berkeley) 7/24/94";
  43 #else
  44 __RCSID("$NetBSD: stoc.c,v 1.5 1999/09/08 21:17:50 jsm Exp $");
  45 #endif
  46 #endif /* not lint */
  47
  48 #include <ctype.h>
  49 #include <stdlib.h>
  50 #include "gomoku.h"
  51
  52 const char      *letters        = "<ABCDEFGHJKLMNOPQRST>";
  53
  54 struct mvstr {
  55         int     m_code;
  56         const char      *m_text;
  57 };
  58 static  const struct    mvstr   mv[] = {
  59         { RESIGN,       "resign" },
  60         { RESIGN,       "quit" },
  61         { SAVE,         "save" },
  62         { -1,           0 }
  63 };
  64
  65 /*
  66  * Turn the spot number form of a move into the character form.
  67  */
  68 const char *
  69 stoc(s)
  70         int s;
  71 {
  72         static char buf[32];
  73         int i;
  74
  75         for (i = 0; mv[i].m_code >= 0; i++)
  76                 if (s == mv[i].m_code)
  77                         return(mv[i].m_text);
  78         sprintf(buf, "%c%d", letters[s % BSZ1], s / BSZ1);
  79         return(buf);
  80 }
  81
  82 /*
  83  * Turn the character form of a move into the spot number form.
  84  */
  85 int
  86 ctos(mp)
  87         const char *mp;
  88 {
  89         int i;
  90
  91         for (i = 0; mv[i].m_code >= 0; i++)
  92                 if (strcmp(mp, mv[i].m_text) == 0)
  93                         return(mv[i].m_code);
  94         if (!isalpha(mp[0]))
  95                 return(ILLEGAL);
  96         i = atoi(&mp[1]);
  97         if (i < 1 || i > 19)
  98                 return(ILLEGAL);
  99         return(PT(lton(mp[0]), i));
 100 }
 101
 102 /*
 103  * Turn a letter into a number.
 104  */
 105 int
 106 lton(c)
 107         int c;
 108 {
 109         int i;
 110
 111         if (islower(c))
 112                 c = toupper(c);
 113         for (i = 1; i <= BSZ && letters[i] != c; i++)
 114                 ;
 115         return(i);
 116 }