action getARCaction (Game g) {
   action a;
   a.actionCode = OBTAIN_ARC;

   // initialise array of possible paths
   char * possibilities[PATH_LIMIT]; // Array of strings
   char * testPath[PATH_LIMIT]; // A single path

   int x = 0;
   while (x < PATH_LIMIT) {
      possibilities[x] = " ";
      testPath[x] = " ";
      x++;
   }

   // Here is the path that goes through all possible edges
   path allARC = "RRLRLBRLRLRRRRLRLRLLLLRLRLRLRRRRLRLRLRLLLLRLRLRRRRL"
                 "RLRRLRLRRRRLRLRLLLLRLRLRLRRRRLRLRLRLLLLRLRLRRRRLRL";

   // Iterate through all edges to record possibilities
   int possibilitiesPosition = 0; // stores where we store possibilties
   int maxARCposition = (strlen (allARC)); // stops overflow
   int position = 6; // move path to starting edge

   while (position <= maxARCposition) {
      strncpy (*testPath, allARC, position); // put new test string in
      // using position as index since position is a count, and we want
      // to reach the next index in the array.
      // testPath[position] = EOF;
      strcpy (a.destination, *testPath); // put test string into action

      // if the path is a legal move, put it into possibilities
      if (isLegalAction (g, a) == TRUE) {
         strcpy (possibilities[possibilitiesPosition], *testPath);
         possibilitiesPosition++;
      }
      // try one more step in the path
      position++;
   }

   // make sure atleast one possibility, if not return empty path
   if (strcmp (possibilities[0], " ") == 0) {
      strcpy (a.destination, " ");
   // otherwise, literally go and put the path into the action
   } else {
      strcpy (a.destination, possibilities[0]);
   }

   return a;
}