The Big Programming Thread - Page 186

void generateLegalMoves()
{
    vector<int>temp;

    for (unsigned int d = 0; d < board.size(); ++d)
    {
        // finds all the single moves
        if (board[d] <= maxSum)
        {
            temp.push_back(1);
            temp.push_back(board[d]);
            temp.push_back(board[d]);
            legalMoves.push_back(temp);
            temp.clear();
        }

        // finds all the double moves
        if ((d + 1) < board.size() )
        {
            for (unsigned int n = (d + 1); n < board.size(); ++n)
            {
                if (board[d] + board[n] <= maxSum)
                {
                    temp.push_back(2);
                    temp.push_back(board[d]);
                    temp.push_back(board[n]);
                    legalMoves.push_back(temp);
                    temp.clear();
                }
            }
        }
    }
}

if ( GameType.isFinalPosition() )
{
                // If it is a tie game, return 0 for the score
                if ( GameType.isTied() )
                    return NEUTRAL_MOVE_SCORE; // score of 0 for the move

		//Checks players turn (To see if good or bad move)
                if ( GameType.getTurn() == FIRST_PLAYER_TURN )
                    return GOOD_MOVE_SCORE;  //Returns score of +1 for the move

                else
                    return BAD_MOVE_SCORE; // Returns score of -3 for bad move
}
...
// calls GameType.getLegalMoves() and with a depth-first search recursively iterates 
// through the resulting position of each move and returns the score.

// When there are no more legalMoves remaining, the final position has been reached
// No more numbers can be crossed out. So whoever crossed out the last number
// wins the game
bool CrossoutGame::isFinalPosition() const
{
    return (legalMoves.size() == 0) ? true : false;
}

void generateLegalMoves()
{
    vector<int>temp;

    for (unsigned int d = 0; d < board.size(); ++d)
    {
        // finds all the single moves
        if (board[d] <= maxSum)
        {
            temp.push_back(1);
            temp.push_back(board[d]);
            temp.push_back(board[d]);
            legalMoves.push_back(temp);
            temp.clear();
        }

        // finds all the double moves
        if ((d + 1) < board.size() )
        {
            for (unsigned int n = (d + 1); n < board.size(); ++n)
            {
                if (board[d] + board[n] <= maxSum)
                {
                    temp.push_back(2);
                    temp.push_back(board[d]);
                    temp.push_back(board[n]);
                    legalMoves.push_back(temp);
                    temp.clear();
                }
            }
        }
    }
}

#include <cstdio>
#include <vector>

typedef std::vector<int> vi;
typedef std::vector<vi> vvi;

// d: depth
// k: current number
// n: end of set (1,..,n)
// m: max sum
// cs: current sum
// cur: current answer
// res: resultset
void dfs(int d, int k, int n, int m, int cs, vi &cur, vvi &res)
{
    if (d==2) {
        res.push_back(cur);
        return;
    }

    if (k > m) return;

    if (d==1) res.push_back(cur);

    for(int i=k;i<=n;++i) {
        cs+=i;
        if (cs > m) return;
        cur.push_back(i);
        dfs(d+1, k+1, n, m, cs, cur, res);
        cs-=i;
        cur.pop_back();
    }
}

int main()
{
    vvi res;
    vi cur;

    for(int i=4;i<20;++i) {
        res.clear();
        cur.clear();
        printf("Solution for N=%d and M=%d\n", i, i+5);
        dfs(0, 1, i, i+5, 0, cur, res);
        for(int j=0;j<res.size();++j) {
            for(int k=0;k<res[j].size();++k) {
                printf("%d ", res[j][k]);
            }
            printf("\n");
        }
        printf("\n");
    }

    return 0;
}

const int row = 52;
const int column = 72;


void printRace(const char grid[row][column])   //prints 52 by 72 grid
{
   for (int i = 0; i < row; i++)
   {
      for (int j = 0; j < column; j++)
      {
         cout << grid[i][j];
      }
      cout << endl;
   }
}


void initRace(const char track[row][column])
{
   for (int i = 0; i == 0 && i == 51; i++)   //top and bottom boundary
   {
      for (int j = 0; j < 72; j++)
      {
         track[i][j] = 'X';     // <------------- COMPUTER SAYS ERROR ON THIS LINE
      }
   }

   for (int i = 1; i == 50; i++)       //left and right boundary
   {
      for (int j = 0; j == 0 && j == 71; j++)
      {
         track[i][j] = 'X';    // <------------- COMPUTER SAYS ERROR ON THIS LINE
      }
   }
}


int main()
{

   printRace(row, column);
   initRace(row, column);


   return 0;


}

void initRace(const char track[row][column])
{
   for (int i = 0; i == 0 && i == 51; i++)   //top and bottom boundary
   {
      for (int j = 0; j < 72; j++)
      {
         track[i][j] = 'X';     // <------------- COMPUTER SAYS ERROR ON THIS LINE
      }
   }

  ....

}

void initRace(char track[row][column])
{
      for (int j = 0; j < 72; j++)
      {
         track[0][j] = 'X';
         track[51][j] = 'X';
      }
   
  ....

}

int main()
{

   printRace(row, column);  
   initRace(row, column);

   return 0;

}

for (int i = 0; i == 0 && i == 51; i++)

for (int i = 0; i == 0 || i == 51; i++)

for (int i = 0; i == 0 || i == 51; i+51)