Question

Need help in c++ programming to output the lines in my code:

if word if found:

           cout << "'" << word << "' was found in the grid" << endl;

           cout << "'" << word << "' was not found in the grid" << endl;

The words can be touching if they are horizontally, vertically, or diagonally adjacent. For example, the board:

Q W E R T

A S D F G

Z X C V B

Y U A O P

G H J K L

contains the magic words WAS, WAXY, JOB, and others, but not the word BOX.

My code makes a grid and asks user to enter a word but does not output if the word exists in the grid or not. I need help to add the above lines in my code so when user enters a word the program checks if the word is found in the grid or not.

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

using namespace std;

int n;
char grid [10] [10];
int z;
int j;

bool dfs(char grid[5][5], bool visited[5][5], string word, int ind, int x, int y){
    //This means we have reached the end of word
    if(word[ind] == '\0') return true;

    if(x<0 || x>=n) return false;

    if(y<0 || y>=n) return false;

    if(grid[x][y]!= word[ind]) return false;

    if(visited[x][y]) return false;

    visited[x][y] = true;

    bool success = false;

    for(int i=x-1; i<=x+1; i++){
        for(int k = y-1; y<=y+1;k++){

            success =dfs(grid, visited, word,ind+1,i,k);
            if (success) break;
        }
        if (success) break;

    }

    visited[x][y] = false;

    return success;
}


int main()
{

    bool found = false;
    string word;
    // declare an array with alphabet
    char alphabet[26] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g',
                          'h', 'i', 'j', 'k', 'l', 'm', 'n',
                          'o', 'p', 'q', 'r', 's', 't', 'u',
                          'v', 'w', 'x', 'y', 'z' };

    bool visited[5][5];
    char grid[5][5];
    n=5;
    for (z = 0; z < n; z++)
    {
        for (j=0; j < n; j++)
        {
          // print letters
          grid [z] [j] = alphabet[rand() % 26];
          cout<<grid [z] [j]<<" ";
        }
        cout<<endl;
    }

    //The visited array is the make sure there are no duplicate letters from the grid
    //visited = new bool*[n];
    for(z=0;z<n;z++){
       // visited[z] = new bool[n];
        for(j=0;j<n;j++){
            visited[z][j] = false;
        }
    }

    cout<<"Enter the word to search for: ";
    cin>>word;

    for (z = 0; z < n; z++)
    {
        for (j=0; j < n; j++)
        {
            if(grid[z][j] == word[0]){
                visited[z][j] = true;
                found = dfs(grid,visited,word,0, z,j);
                visited[z][j] = false;
            }
            if(found) break;
        }
        if(found) break;
    }
}

Answer 1

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

using namespace std;

int n;
char grid [10][10];
int z;
int j;

bool dfs(char grid[5][5], bool visited[5][5], string word, int ind, int x, int y){
    //This means we have reached the end of word
    if(word[ind] == '\0') return true;

    if(x<0 || x>=n) return false;

    if(y<0 || y>=n) return false;

    if(grid[x][y]!= word[ind]) return false;

    if(visited[x][y]) return false;

    visited[x][y] = true;

    bool success = false;

    for(int i=x-1; i<=x+1; i++){
        for(int k = y-1; k<=y+1;k++){
                        
                if(!(i == x && k == y)) {
                        success = dfs(grid, visited, word,ind+1,i,k);
                        if (success)
                                break;
                }
        }
        if (success) 
                        break;

    }

    visited[x][y] = false;

    return success;
}


int main()
{

    bool found = false;
    string word;
    // declare an array with alphabet
    char alphabet[26] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g',
                          'h', 'i', 'j', 'k', 'l', 'm', 'n',
                          'o', 'p', 'q', 'r', 's', 't', 'u',
                          'v', 'w', 'x', 'y', 'z' };

    bool visited[5][5];
    char grid[5][5];
    n=5;
    for (z = 0; z < n; z++)
    {
        for (j=0; j < n; j++)
        {
          // print letters
          grid [z][j] = alphabet[rand() % 26];
          cout<<grid [z][j]<<" ";
        }
        cout<<endl;
    }

    //The visited array is the make sure there are no duplicate letters from the grid
    for(z=0;z<n;z++){
        for(j=0;j<n;j++){
            visited[z][j] = false;
        }
    }
    
    while(true) {
        cout<<"Enter the word to search for: ";
        cin>>word;

        for (z = 0; z < n; z++)
        {
            for (j=0; j < n; j++)
            {
                if(grid[z][j] == word[0]){
                    found = dfs(grid,visited,word,0, z,j);
                    if(found) {
                            cout << "Word found at " << z << ", " << j << endl;
                    }
                }
                if(found) break;
            }
            if(found) break;
        }
        if(!found) { cout << "Word not found" << endl; }
        
        char choice;
        cout << "Enter y for another word: ";
        cin >> choice;
        if(choice != 'y') { break; }
    }
}