#include #include #include const int ROW = 15; const int COL = 15; const int DEX = 30; const int NUM = 10; /* Known bugs: None. Known fix : Don't fix what's not broken. :D Update log" - Added slanting orientation for string insertion to puzzle. - Fixed term selection repetition bug. - Replaced rows, column, term index and string-selection index with constants. - You may now adjust size of puzzle and number of terms just by adjusting the const parameters. Please comment the changes/updates that you wish to see. I'll try to do what's possible. :> */ void puzzle_generation(char array1[ROW][COL], bool array2[ROW][COL]) { for (int i = 0; i < ROW; i++) for (int j = 0; j < COL; j++) { array1[i][j] = char(65 + rand() % 26); array2[i][j] = false; } } void puzzle_print(char array[ROW][COL]) { for (int i = 0; i < ROW; i++, std::cout << "\n") for (int j = 0; j < COL; j++) std::cout << array[i][j] << " "; } void puzzle_fit(char array1[ROW][COL], bool array2[ROW][COL], std::string term[30], std::string find[NUM]) { int row, column, orientation, selection, term_dex, find_dex, count; bool repeat; find_dex = count = 0; while (count < NUM) { orientation = rand() % 3; do { selection = rand() % DEX; } while (term[selection] == ""); term_dex = 0; repeat = false; switch (orientation) { case 0: column = rand() % COL; row = ROW - term[selection].length() - (rand() % (ROW - term[selection].length())); for (int i = row; i < (row + term[selection].length()); i++) if (array2[i][column]) { repeat = true; break; } if (!repeat) for (int i = row; i < (row + term[selection].length()); i++) { array1[i][column] = (term[selection])[term_dex++]; array2[i][column] = true; } break; case 1: row = rand() % ROW; column = COL - term[selection].length() - (rand() % (COL - term[selection].length())); for (int i = column; i < (column + term[selection].length()); i++) if (array2[row][i]) { repeat = true; break; } if (!repeat) for (int i = column; i < (column + term[selection].length()); i++) { array1[row][i] = (term[selection])[term_dex++]; array2[row][i] = true; } break; case 2: row = ROW - term[selection].length() - (rand() % (ROW - term[selection].length())); column = COL - term[selection].length() - (rand() % (COL - term[selection].length())); for (int i = 0; i < (row + term[selection].length()) && !repeat;) for (int j = 0; j < (column + term[selection].length()); i++, j++) if (array2[i][j]) { repeat = true; break; } if (!repeat) for (int i = row; i < (row + term[selection].length());) for (int j = column; j < (column + term[selection].length()); i++, j++) { array1[i][j] = (term[selection])[term_dex++]; array2[i][j] = true; } break; } if (!repeat) { count++; find[find_dex++] = term[selection]; term[selection] = ""; } } } int main() { srand(time(0)); char maze[ROW][COL]; bool mark[ROW][COL]; std::string term[DEX] = {"HOTEL", "POINT", "TOUR", "TRUE", "WORLD", "STATUE", "CAPITAL", "FAIRY", "YEAR", "CROWN", "ARRIVE", "NIGHT", "DESTINY", "NEXT", "LUNCH", "CHILD", "TALK", "TWINS", "PASS", "PRICE", "BOARD", "JUNK", "STAY", "INVITE", "BEAUTY", "INSIDE", "HARSH", "COVER", "CHECK", "TELL"}; std::string find[NUM]; puzzle_generation(maze, mark); puzzle_fit(maze, mark, term, find); puzzle_print(maze); std::cout << std::endl << "Strings included : " << std::endl; for (int i = 0; i < NUM; i++) std::cout << " - " << find[i] << std::endl; return 0; }

Word Search!