Home » Archimedes archive » Acorn User » AU 1998-05 A.adf » Regulars » StarInfo/SIpuzzle/c/solve

StarInfo/SIpuzzle/c/solve

This website contains an archive of files for the Acorn Electron, BBC Micro, Acorn Archimedes, Commodore 16 and Commodore 64 computers, which Dominic Ford has rescued from his private collection of floppy disks and cassettes.

Some of these files were originally commercial releases in the 1980s and 1990s, but they are now widely available online. I assume that copyright over them is no longer being asserted. If you own the copyright and would like files to be removed, please contact me.

Tape/disk: Home » Archimedes archive » Acorn User » AU 1998-05 A.adf » Regulars
Filename: StarInfo/SIpuzzle/c/solve
Read OK: ✔
File size: 0BFB bytes
Load address: 0000
Exec address: 0000
File contents
/*************************************************************
solve.c
**************************************************************/

#include <stdlib.h>
#include <stdio.h>

#define EMPTY '?'
#define TERM '\0'

#define MAX_DEPTH (28)

struct holestr;

struct holestr
{
  char peg;
  char start;
  char dest;
  int x;
  int y;
  int n_links;
  int visited;
  struct holestr *link[5];
  struct holestr *aim;
};

typedef struct holestr HOLE;

typedef struct
{
  HOLE b[3][3];
  HOLE terminate;
} BOARD;

static BOARD board;

static HOLE *solution[MAX_DEPTH];

static char start_pos[3][3] = {
  'T','A','R',
  'S',EMPTY,'I',
  'O','F','N'
};

static char end_pos[3][3] = {
  'A','T','S',
  'R',EMPTY,'O',
  'I','N','F'
};

static void show_board(void)
{
  int x,y;
  for (y = 0; y < 3; y++)
  {
    for (x = 0; x < 3; x++)
    {
      HOLE *h = &board.b[y][x];
      printf("[%c][%d]",h->peg,h->n_links);
    }
    printf("\n");
  }
}

static void check_solution(int depth)
{
  HOLE *h;
  int i;
  for (h = &board.b[0][0]; h->peg != TERM; h++)
    if (h->peg != h->dest) return;
  printf("Solved in %d\n",depth + 1);
  printf("---\n");
  for (i = 0; i < depth; i++)
  {
    int x,y;
    HOLE *h = solution[i];
    for (y = 0; y < 3; y++)
    {
      for (x = 0; x < 3; x++)
      {
        printf("%c", (x == h->x && y == h->y) ? 'x':'.');
      }
      printf("\n");
    }
    printf("---\n");
  }
  printf("\n");
}

static void solve(HOLE *from, HOLE *to, int depth)
{
  HOLE **p;

  solution[depth] = from;

  to->peg = from->peg;
  from->peg = EMPTY;

  if (to->peg == to->start)
  {
    HOLE * h = &board.b[0][0];
    while (h->peg != TERM && h->peg == h->start)
      h++;
    if (h->peg == TERM)
    {
      from->peg = to->peg;
      to->peg = EMPTY;
      return;
    }
  }

  if (to->peg == to->dest)
    check_solution(depth);
    
  if (depth < MAX_DEPTH)
  {
    p = from->link;
    
    while (*p != NULL)
    {
      if (*p != to)
        solve(*p, from, depth + 1);
      p++;
    }
  }
  
  from->peg = to->peg;
  to->peg = EMPTY;
}

static void add_link(HOLE *h, int x, int y)
{
  if (x >= 0 && x < 3 && y >= 0 && y < 3)
    h->link[h->n_links++] = &board.b[y][x];
}

int main()
{
  int x,y;
  HOLE *h;
  
  printf("Solve (v0.10)\n");
  
  board.terminate.peg = TERM;
  
  for (y = 0; y < 3; y++)
  {
    for (x = 0; x < 3; x++)
    {
      h = &board.b[y][x];
      h->n_links = 0;
      h->x = x;
      h->y = y;
      h->peg = h->start = start_pos[y][x];
      h->dest = end_pos[y][x];
      
      add_link(h, x - 1, y);
      add_link(h, x + 1, y);
      add_link(h, x, y - 1);
      add_link(h, x, y + 1);
      
      h->link[h->n_links] = 0;
      
      h->visited = 0;
    }
  }
  
  for (h = &board.b[0][0]; h->peg != TERM; h++)
  {
    HOLE *i = &board.b[0][0];
    while (i == h || h->dest != i->peg)
      i++;
    h->aim = i;
  }

  solve(&board.b[1][0], &board.b[1][1], 0);
  solve(&board.b[1][2], &board.b[1][1], 0);
  solve(&board.b[0][1], &board.b[1][1], 0);
  solve(&board.b[2][1], &board.b[1][1], 0);
  
  printf("Finished\n");
}

00000000  2f 2a 2a 2a 2a 2a 2a 2a  2a 2a 2a 2a 2a 2a 2a 2a  |/***************|
00000010  2a 2a 2a 2a 2a 2a 2a 2a  2a 2a 2a 2a 2a 2a 2a 2a  |****************|
*
00000030  2a 2a 2a 2a 2a 2a 2a 2a  2a 2a 2a 2a 2a 2a 0a 73  |**************.s|
00000040  6f 6c 76 65 2e 63 0a 2a  2a 2a 2a 2a 2a 2a 2a 2a  |olve.c.*********|
00000050  2a 2a 2a 2a 2a 2a 2a 2a  2a 2a 2a 2a 2a 2a 2a 2a  |****************|
*
00000080  2a 2a 2a 2a 2a 2f 0a 0a  23 69 6e 63 6c 75 64 65  |*****/..#include|
00000090  20 3c 73 74 64 6c 69 62  2e 68 3e 0a 23 69 6e 63  | <stdlib.h>.#inc|
000000a0  6c 75 64 65 20 3c 73 74  64 69 6f 2e 68 3e 0a 0a  |lude <stdio.h>..|
000000b0  23 64 65 66 69 6e 65 20  45 4d 50 54 59 20 27 3f  |#define EMPTY '?|
000000c0  27 0a 23 64 65 66 69 6e  65 20 54 45 52 4d 20 27  |'.#define TERM '|
000000d0  5c 30 27 0a 0a 23 64 65  66 69 6e 65 20 4d 41 58  |\0'..#define MAX|
000000e0  5f 44 45 50 54 48 20 28  32 38 29 0a 0a 73 74 72  |_DEPTH (28)..str|
000000f0  75 63 74 20 68 6f 6c 65  73 74 72 3b 0a 0a 73 74  |uct holestr;..st|
00000100  72 75 63 74 20 68 6f 6c  65 73 74 72 0a 7b 0a 20  |ruct holestr.{. |
00000110  20 63 68 61 72 20 70 65  67 3b 0a 20 20 63 68 61  | char peg;.  cha|
00000120  72 20 73 74 61 72 74 3b  0a 20 20 63 68 61 72 20  |r start;.  char |
00000130  64 65 73 74 3b 0a 20 20  69 6e 74 20 78 3b 0a 20  |dest;.  int x;. |
00000140  20 69 6e 74 20 79 3b 0a  20 20 69 6e 74 20 6e 5f  | int y;.  int n_|
00000150  6c 69 6e 6b 73 3b 0a 20  20 69 6e 74 20 76 69 73  |links;.  int vis|
00000160  69 74 65 64 3b 0a 20 20  73 74 72 75 63 74 20 68  |ited;.  struct h|
00000170  6f 6c 65 73 74 72 20 2a  6c 69 6e 6b 5b 35 5d 3b  |olestr *link[5];|
00000180  0a 20 20 73 74 72 75 63  74 20 68 6f 6c 65 73 74  |.  struct holest|
00000190  72 20 2a 61 69 6d 3b 0a  7d 3b 0a 0a 74 79 70 65  |r *aim;.};..type|
000001a0  64 65 66 20 73 74 72 75  63 74 20 68 6f 6c 65 73  |def struct holes|
000001b0  74 72 20 48 4f 4c 45 3b  0a 0a 74 79 70 65 64 65  |tr HOLE;..typede|
000001c0  66 20 73 74 72 75 63 74  0a 7b 0a 20 20 48 4f 4c  |f struct.{.  HOL|
000001d0  45 20 62 5b 33 5d 5b 33  5d 3b 0a 20 20 48 4f 4c  |E b[3][3];.  HOL|
000001e0  45 20 74 65 72 6d 69 6e  61 74 65 3b 0a 7d 20 42  |E terminate;.} B|
000001f0  4f 41 52 44 3b 0a 0a 73  74 61 74 69 63 20 42 4f  |OARD;..static BO|
00000200  41 52 44 20 62 6f 61 72  64 3b 0a 0a 73 74 61 74  |ARD board;..stat|
00000210  69 63 20 48 4f 4c 45 20  2a 73 6f 6c 75 74 69 6f  |ic HOLE *solutio|
00000220  6e 5b 4d 41 58 5f 44 45  50 54 48 5d 3b 0a 0a 73  |n[MAX_DEPTH];..s|
00000230  74 61 74 69 63 20 63 68  61 72 20 73 74 61 72 74  |tatic char start|
00000240  5f 70 6f 73 5b 33 5d 5b  33 5d 20 3d 20 7b 0a 20  |_pos[3][3] = {. |
00000250  20 27 54 27 2c 27 41 27  2c 27 52 27 2c 0a 20 20  | 'T','A','R',.  |
00000260  27 53 27 2c 45 4d 50 54  59 2c 27 49 27 2c 0a 20  |'S',EMPTY,'I',. |
00000270  20 27 4f 27 2c 27 46 27  2c 27 4e 27 0a 7d 3b 0a  | 'O','F','N'.};.|
00000280  0a 73 74 61 74 69 63 20  63 68 61 72 20 65 6e 64  |.static char end|
00000290  5f 70 6f 73 5b 33 5d 5b  33 5d 20 3d 20 7b 0a 20  |_pos[3][3] = {. |
000002a0  20 27 41 27 2c 27 54 27  2c 27 53 27 2c 0a 20 20  | 'A','T','S',.  |
000002b0  27 52 27 2c 45 4d 50 54  59 2c 27 4f 27 2c 0a 20  |'R',EMPTY,'O',. |
000002c0  20 27 49 27 2c 27 4e 27  2c 27 46 27 0a 7d 3b 0a  | 'I','N','F'.};.|
000002d0  0a 73 74 61 74 69 63 20  76 6f 69 64 20 73 68 6f  |.static void sho|
000002e0  77 5f 62 6f 61 72 64 28  76 6f 69 64 29 0a 7b 0a  |w_board(void).{.|
000002f0  20 20 69 6e 74 20 78 2c  79 3b 0a 20 20 66 6f 72  |  int x,y;.  for|
00000300  20 28 79 20 3d 20 30 3b  20 79 20 3c 20 33 3b 20  | (y = 0; y < 3; |
00000310  79 2b 2b 29 0a 20 20 7b  0a 20 20 20 20 66 6f 72  |y++).  {.    for|
00000320  20 28 78 20 3d 20 30 3b  20 78 20 3c 20 33 3b 20  | (x = 0; x < 3; |
00000330  78 2b 2b 29 0a 20 20 20  20 7b 0a 20 20 20 20 20  |x++).    {.     |
00000340  20 48 4f 4c 45 20 2a 68  20 3d 20 26 62 6f 61 72  | HOLE *h = &boar|
00000350  64 2e 62 5b 79 5d 5b 78  5d 3b 0a 20 20 20 20 20  |d.b[y][x];.     |
00000360  20 70 72 69 6e 74 66 28  22 5b 25 63 5d 5b 25 64  | printf("[%c][%d|
00000370  5d 22 2c 68 2d 3e 70 65  67 2c 68 2d 3e 6e 5f 6c  |]",h->peg,h->n_l|
00000380  69 6e 6b 73 29 3b 0a 20  20 20 20 7d 0a 20 20 20  |inks);.    }.   |
00000390  20 70 72 69 6e 74 66 28  22 5c 6e 22 29 3b 0a 20  | printf("\n");. |
000003a0  20 7d 0a 7d 0a 0a 73 74  61 74 69 63 20 76 6f 69  | }.}..static voi|
000003b0  64 20 63 68 65 63 6b 5f  73 6f 6c 75 74 69 6f 6e  |d check_solution|
000003c0  28 69 6e 74 20 64 65 70  74 68 29 0a 7b 0a 20 20  |(int depth).{.  |
000003d0  48 4f 4c 45 20 2a 68 3b  0a 20 20 69 6e 74 20 69  |HOLE *h;.  int i|
000003e0  3b 0a 20 20 66 6f 72 20  28 68 20 3d 20 26 62 6f  |;.  for (h = &bo|
000003f0  61 72 64 2e 62 5b 30 5d  5b 30 5d 3b 20 68 2d 3e  |ard.b[0][0]; h->|
00000400  70 65 67 20 21 3d 20 54  45 52 4d 3b 20 68 2b 2b  |peg != TERM; h++|
00000410  29 0a 20 20 20 20 69 66  20 28 68 2d 3e 70 65 67  |).    if (h->peg|
00000420  20 21 3d 20 68 2d 3e 64  65 73 74 29 20 72 65 74  | != h->dest) ret|
00000430  75 72 6e 3b 0a 20 20 70  72 69 6e 74 66 28 22 53  |urn;.  printf("S|
00000440  6f 6c 76 65 64 20 69 6e  20 25 64 5c 6e 22 2c 64  |olved in %d\n",d|
00000450  65 70 74 68 20 2b 20 31  29 3b 0a 20 20 70 72 69  |epth + 1);.  pri|
00000460  6e 74 66 28 22 2d 2d 2d  5c 6e 22 29 3b 0a 20 20  |ntf("---\n");.  |
00000470  66 6f 72 20 28 69 20 3d  20 30 3b 20 69 20 3c 20  |for (i = 0; i < |
00000480  64 65 70 74 68 3b 20 69  2b 2b 29 0a 20 20 7b 0a  |depth; i++).  {.|
00000490  20 20 20 20 69 6e 74 20  78 2c 79 3b 0a 20 20 20  |    int x,y;.   |
000004a0  20 48 4f 4c 45 20 2a 68  20 3d 20 73 6f 6c 75 74  | HOLE *h = solut|
000004b0  69 6f 6e 5b 69 5d 3b 0a  20 20 20 20 66 6f 72 20  |ion[i];.    for |
000004c0  28 79 20 3d 20 30 3b 20  79 20 3c 20 33 3b 20 79  |(y = 0; y < 3; y|
000004d0  2b 2b 29 0a 20 20 20 20  7b 0a 20 20 20 20 20 20  |++).    {.      |
000004e0  66 6f 72 20 28 78 20 3d  20 30 3b 20 78 20 3c 20  |for (x = 0; x < |
000004f0  33 3b 20 78 2b 2b 29 0a  20 20 20 20 20 20 7b 0a  |3; x++).      {.|
00000500  20 20 20 20 20 20 20 20  70 72 69 6e 74 66 28 22  |        printf("|
00000510  25 63 22 2c 20 28 78 20  3d 3d 20 68 2d 3e 78 20  |%c", (x == h->x |
00000520  26 26 20 79 20 3d 3d 20  68 2d 3e 79 29 20 3f 20  |&& y == h->y) ? |
00000530  27 78 27 3a 27 2e 27 29  3b 0a 20 20 20 20 20 20  |'x':'.');.      |
00000540  7d 0a 20 20 20 20 20 20  70 72 69 6e 74 66 28 22  |}.      printf("|
00000550  5c 6e 22 29 3b 0a 20 20  20 20 7d 0a 20 20 20 20  |\n");.    }.    |
00000560  70 72 69 6e 74 66 28 22  2d 2d 2d 5c 6e 22 29 3b  |printf("---\n");|
00000570  0a 20 20 7d 0a 20 20 70  72 69 6e 74 66 28 22 5c  |.  }.  printf("\|
00000580  6e 22 29 3b 0a 7d 0a 0a  73 74 61 74 69 63 20 76  |n");.}..static v|
00000590  6f 69 64 20 73 6f 6c 76  65 28 48 4f 4c 45 20 2a  |oid solve(HOLE *|
000005a0  66 72 6f 6d 2c 20 48 4f  4c 45 20 2a 74 6f 2c 20  |from, HOLE *to, |
000005b0  69 6e 74 20 64 65 70 74  68 29 0a 7b 0a 20 20 48  |int depth).{.  H|
000005c0  4f 4c 45 20 2a 2a 70 3b  0a 0a 20 20 73 6f 6c 75  |OLE **p;..  solu|
000005d0  74 69 6f 6e 5b 64 65 70  74 68 5d 20 3d 20 66 72  |tion[depth] = fr|
000005e0  6f 6d 3b 0a 0a 20 20 74  6f 2d 3e 70 65 67 20 3d  |om;..  to->peg =|
000005f0  20 66 72 6f 6d 2d 3e 70  65 67 3b 0a 20 20 66 72  | from->peg;.  fr|
00000600  6f 6d 2d 3e 70 65 67 20  3d 20 45 4d 50 54 59 3b  |om->peg = EMPTY;|
00000610  0a 0a 20 20 69 66 20 28  74 6f 2d 3e 70 65 67 20  |..  if (to->peg |
00000620  3d 3d 20 74 6f 2d 3e 73  74 61 72 74 29 0a 20 20  |== to->start).  |
00000630  7b 0a 20 20 20 20 48 4f  4c 45 20 2a 20 68 20 3d  |{.    HOLE * h =|
00000640  20 26 62 6f 61 72 64 2e  62 5b 30 5d 5b 30 5d 3b  | &board.b[0][0];|
00000650  0a 20 20 20 20 77 68 69  6c 65 20 28 68 2d 3e 70  |.    while (h->p|
00000660  65 67 20 21 3d 20 54 45  52 4d 20 26 26 20 68 2d  |eg != TERM && h-|
00000670  3e 70 65 67 20 3d 3d 20  68 2d 3e 73 74 61 72 74  |>peg == h->start|
00000680  29 0a 20 20 20 20 20 20  68 2b 2b 3b 0a 20 20 20  |).      h++;.   |
00000690  20 69 66 20 28 68 2d 3e  70 65 67 20 3d 3d 20 54  | if (h->peg == T|
000006a0  45 52 4d 29 0a 20 20 20  20 7b 0a 20 20 20 20 20  |ERM).    {.     |
000006b0  20 66 72 6f 6d 2d 3e 70  65 67 20 3d 20 74 6f 2d  | from->peg = to-|
000006c0  3e 70 65 67 3b 0a 20 20  20 20 20 20 74 6f 2d 3e  |>peg;.      to->|
000006d0  70 65 67 20 3d 20 45 4d  50 54 59 3b 0a 20 20 20  |peg = EMPTY;.   |
000006e0  20 20 20 72 65 74 75 72  6e 3b 0a 20 20 20 20 7d  |   return;.    }|
000006f0  0a 20 20 7d 0a 0a 20 20  69 66 20 28 74 6f 2d 3e  |.  }..  if (to->|
00000700  70 65 67 20 3d 3d 20 74  6f 2d 3e 64 65 73 74 29  |peg == to->dest)|
00000710  0a 20 20 20 20 63 68 65  63 6b 5f 73 6f 6c 75 74  |.    check_solut|
00000720  69 6f 6e 28 64 65 70 74  68 29 3b 0a 20 20 20 20  |ion(depth);.    |
00000730  0a 20 20 69 66 20 28 64  65 70 74 68 20 3c 20 4d  |.  if (depth < M|
00000740  41 58 5f 44 45 50 54 48  29 0a 20 20 7b 0a 20 20  |AX_DEPTH).  {.  |
00000750  20 20 70 20 3d 20 66 72  6f 6d 2d 3e 6c 69 6e 6b  |  p = from->link|
00000760  3b 0a 20 20 20 20 0a 20  20 20 20 77 68 69 6c 65  |;.    .    while|
00000770  20 28 2a 70 20 21 3d 20  4e 55 4c 4c 29 0a 20 20  | (*p != NULL).  |
00000780  20 20 7b 0a 20 20 20 20  20 20 69 66 20 28 2a 70  |  {.      if (*p|
00000790  20 21 3d 20 74 6f 29 0a  20 20 20 20 20 20 20 20  | != to).        |
000007a0  73 6f 6c 76 65 28 2a 70  2c 20 66 72 6f 6d 2c 20  |solve(*p, from, |
000007b0  64 65 70 74 68 20 2b 20  31 29 3b 0a 20 20 20 20  |depth + 1);.    |
000007c0  20 20 70 2b 2b 3b 0a 20  20 20 20 7d 0a 20 20 7d  |  p++;.    }.  }|
000007d0  0a 20 20 0a 20 20 66 72  6f 6d 2d 3e 70 65 67 20  |.  .  from->peg |
000007e0  3d 20 74 6f 2d 3e 70 65  67 3b 0a 20 20 74 6f 2d  |= to->peg;.  to-|
000007f0  3e 70 65 67 20 3d 20 45  4d 50 54 59 3b 0a 7d 0a  |>peg = EMPTY;.}.|
00000800  0a 73 74 61 74 69 63 20  76 6f 69 64 20 61 64 64  |.static void add|
00000810  5f 6c 69 6e 6b 28 48 4f  4c 45 20 2a 68 2c 20 69  |_link(HOLE *h, i|
00000820  6e 74 20 78 2c 20 69 6e  74 20 79 29 0a 7b 0a 20  |nt x, int y).{. |
00000830  20 69 66 20 28 78 20 3e  3d 20 30 20 26 26 20 78  | if (x >= 0 && x|
00000840  20 3c 20 33 20 26 26 20  79 20 3e 3d 20 30 20 26  | < 3 && y >= 0 &|
00000850  26 20 79 20 3c 20 33 29  0a 20 20 20 20 68 2d 3e  |& y < 3).    h->|
00000860  6c 69 6e 6b 5b 68 2d 3e  6e 5f 6c 69 6e 6b 73 2b  |link[h->n_links+|
00000870  2b 5d 20 3d 20 26 62 6f  61 72 64 2e 62 5b 79 5d  |+] = &board.b[y]|
00000880  5b 78 5d 3b 0a 7d 0a 0a  69 6e 74 20 6d 61 69 6e  |[x];.}..int main|
00000890  28 29 0a 7b 0a 20 20 69  6e 74 20 78 2c 79 3b 0a  |().{.  int x,y;.|
000008a0  20 20 48 4f 4c 45 20 2a  68 3b 0a 20 20 0a 20 20  |  HOLE *h;.  .  |
000008b0  70 72 69 6e 74 66 28 22  53 6f 6c 76 65 20 28 76  |printf("Solve (v|
000008c0  30 2e 31 30 29 5c 6e 22  29 3b 0a 20 20 0a 20 20  |0.10)\n");.  .  |
000008d0  62 6f 61 72 64 2e 74 65  72 6d 69 6e 61 74 65 2e  |board.terminate.|
000008e0  70 65 67 20 3d 20 54 45  52 4d 3b 0a 20 20 0a 20  |peg = TERM;.  . |
000008f0  20 66 6f 72 20 28 79 20  3d 20 30 3b 20 79 20 3c  | for (y = 0; y <|
00000900  20 33 3b 20 79 2b 2b 29  0a 20 20 7b 0a 20 20 20  | 3; y++).  {.   |
00000910  20 66 6f 72 20 28 78 20  3d 20 30 3b 20 78 20 3c  | for (x = 0; x <|
00000920  20 33 3b 20 78 2b 2b 29  0a 20 20 20 20 7b 0a 20  | 3; x++).    {. |
00000930  20 20 20 20 20 68 20 3d  20 26 62 6f 61 72 64 2e  |     h = &board.|
00000940  62 5b 79 5d 5b 78 5d 3b  0a 20 20 20 20 20 20 68  |b[y][x];.      h|
00000950  2d 3e 6e 5f 6c 69 6e 6b  73 20 3d 20 30 3b 0a 20  |->n_links = 0;. |
00000960  20 20 20 20 20 68 2d 3e  78 20 3d 20 78 3b 0a 20  |     h->x = x;. |
00000970  20 20 20 20 20 68 2d 3e  79 20 3d 20 79 3b 0a 20  |     h->y = y;. |
00000980  20 20 20 20 20 68 2d 3e  70 65 67 20 3d 20 68 2d  |     h->peg = h-|
00000990  3e 73 74 61 72 74 20 3d  20 73 74 61 72 74 5f 70  |>start = start_p|
000009a0  6f 73 5b 79 5d 5b 78 5d  3b 0a 20 20 20 20 20 20  |os[y][x];.      |
000009b0  68 2d 3e 64 65 73 74 20  3d 20 65 6e 64 5f 70 6f  |h->dest = end_po|
000009c0  73 5b 79 5d 5b 78 5d 3b  0a 20 20 20 20 20 20 0a  |s[y][x];.      .|
000009d0  20 20 20 20 20 20 61 64  64 5f 6c 69 6e 6b 28 68  |      add_link(h|
000009e0  2c 20 78 20 2d 20 31 2c  20 79 29 3b 0a 20 20 20  |, x - 1, y);.   |
000009f0  20 20 20 61 64 64 5f 6c  69 6e 6b 28 68 2c 20 78  |   add_link(h, x|
00000a00  20 2b 20 31 2c 20 79 29  3b 0a 20 20 20 20 20 20  | + 1, y);.      |
00000a10  61 64 64 5f 6c 69 6e 6b  28 68 2c 20 78 2c 20 79  |add_link(h, x, y|
00000a20  20 2d 20 31 29 3b 0a 20  20 20 20 20 20 61 64 64  | - 1);.      add|
00000a30  5f 6c 69 6e 6b 28 68 2c  20 78 2c 20 79 20 2b 20  |_link(h, x, y + |
00000a40  31 29 3b 0a 20 20 20 20  20 20 0a 20 20 20 20 20  |1);.      .     |
00000a50  20 68 2d 3e 6c 69 6e 6b  5b 68 2d 3e 6e 5f 6c 69  | h->link[h->n_li|
00000a60  6e 6b 73 5d 20 3d 20 30  3b 0a 20 20 20 20 20 20  |nks] = 0;.      |
00000a70  0a 20 20 20 20 20 20 68  2d 3e 76 69 73 69 74 65  |.      h->visite|
00000a80  64 20 3d 20 30 3b 0a 20  20 20 20 7d 0a 20 20 7d  |d = 0;.    }.  }|
00000a90  0a 20 20 0a 20 20 66 6f  72 20 28 68 20 3d 20 26  |.  .  for (h = &|
00000aa0  62 6f 61 72 64 2e 62 5b  30 5d 5b 30 5d 3b 20 68  |board.b[0][0]; h|
00000ab0  2d 3e 70 65 67 20 21 3d  20 54 45 52 4d 3b 20 68  |->peg != TERM; h|
00000ac0  2b 2b 29 0a 20 20 7b 0a  20 20 20 20 48 4f 4c 45  |++).  {.    HOLE|
00000ad0  20 2a 69 20 3d 20 26 62  6f 61 72 64 2e 62 5b 30  | *i = &board.b[0|
00000ae0  5d 5b 30 5d 3b 0a 20 20  20 20 77 68 69 6c 65 20  |][0];.    while |
00000af0  28 69 20 3d 3d 20 68 20  7c 7c 20 68 2d 3e 64 65  |(i == h || h->de|
00000b00  73 74 20 21 3d 20 69 2d  3e 70 65 67 29 0a 20 20  |st != i->peg).  |
00000b10  20 20 20 20 69 2b 2b 3b  0a 20 20 20 20 68 2d 3e  |    i++;.    h->|
00000b20  61 69 6d 20 3d 20 69 3b  0a 20 20 7d 0a 0a 20 20  |aim = i;.  }..  |
00000b30  73 6f 6c 76 65 28 26 62  6f 61 72 64 2e 62 5b 31  |solve(&board.b[1|
00000b40  5d 5b 30 5d 2c 20 26 62  6f 61 72 64 2e 62 5b 31  |][0], &board.b[1|
00000b50  5d 5b 31 5d 2c 20 30 29  3b 0a 20 20 73 6f 6c 76  |][1], 0);.  solv|
00000b60  65 28 26 62 6f 61 72 64  2e 62 5b 31 5d 5b 32 5d  |e(&board.b[1][2]|
00000b70  2c 20 26 62 6f 61 72 64  2e 62 5b 31 5d 5b 31 5d  |, &board.b[1][1]|
00000b80  2c 20 30 29 3b 0a 20 20  73 6f 6c 76 65 28 26 62  |, 0);.  solve(&b|
00000b90  6f 61 72 64 2e 62 5b 30  5d 5b 31 5d 2c 20 26 62  |oard.b[0][1], &b|
00000ba0  6f 61 72 64 2e 62 5b 31  5d 5b 31 5d 2c 20 30 29  |oard.b[1][1], 0)|
00000bb0  3b 0a 20 20 73 6f 6c 76  65 28 26 62 6f 61 72 64  |;.  solve(&board|
00000bc0  2e 62 5b 32 5d 5b 31 5d  2c 20 26 62 6f 61 72 64  |.b[2][1], &board|
00000bd0  2e 62 5b 31 5d 5b 31 5d  2c 20 30 29 3b 0a 20 20  |.b[1][1], 0);.  |
00000be0  0a 20 20 70 72 69 6e 74  66 28 22 46 69 6e 69 73  |.  printf("Finis|
00000bf0  68 65 64 5c 6e 22 29 3b  0a 7d 0a                 |hed\n");.}.|
00000bfb

© Dominic Ford 2021–2025.

Our privacy policy is here.
Last updated: 01 May 2025, 21:49 UTC
Website designed by .