End location of the word from words array is not correct.

using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
namespace CmdWordSearch
{
class Program
{
// For searching in all 8 direction
static int[] x = { -1, -1, -1, 0, 0, 1, 1, 1 };
static int[] y = { -1, 0, 1, -1, 1, -1, 0, 1 };
static char[,] Grid = new char[,] {
{'C', 'P', 'K', 'X', 'O', 'I', 'G', 'H', 'S', 'F', 'C', 'H'},
{'Y', 'G', 'W', 'R', 'I', 'A', 'H', 'C', 'Q', 'R', 'X', 'K'},
{'M', 'A', 'X', 'I', 'M', 'I', 'Z', 'A', 'T', 'I', 'O', 'N'},
{'E', 'T', 'W', 'Z', 'N', 'L', 'W', 'G', 'E', 'D', 'Y', 'W'},
{'M', 'C', 'L', 'E', 'L', 'D', 'N', 'V', 'L', 'G', 'P', 'T'},
{'O', 'J', 'A', 'A', 'V', 'I', 'O', 'T', 'E', 'E', 'P', 'X'},
{'C', 'D', 'B', 'P', 'H', 'I', 'A', 'W', 'V', 'X', 'U', 'I'},
{'L', 'G', 'O', 'S', 'S', 'B', 'R', 'Q', 'I', 'A', 'P', 'K'},
{'E', 'O', 'I', 'G', 'L', 'P', 'S', 'D', 'S', 'F', 'W', 'P'},
{'W', 'F', 'K', 'E', 'G', 'O', 'L', 'F', 'I', 'F', 'R', 'S'},
{'O', 'T', 'R', 'U', 'O', 'C', 'D', 'O', 'O', 'F', 'T', 'P'},
{'C', 'A', 'R', 'P', 'E', 'T', 'R', 'W', 'N', 'G', 'V', 'Z'}
};
static string[] Words = new string[]
{
"CARPET",
"CHAIR",
"DOG",
"BALL",
"DRIVEWAY",
"FISHING",
"FOODCOURT",
"FRIDGE",
"GOLF",
"MAXIMIZATION",
"PUPPY",
"SPACE",
"TABLE",
"TELEVISION",
"WELCOME",
"WINDOW"
};
private class WordMatch
{
public readonly bool IsMatch;
public readonly string Word;
public readonly int Direction;
public readonly Coordinates StartPos;
public readonly Coordinates EndPos;
public WordMatch()
{
IsMatch = false;
}
public WordMatch(string word, int startRow, int startCol, int direction, int endRow, int endCol)
{
Word = word;
StartPos = new Coordinates(startRow, startCol);
Direction = direction;
EndPos = new Coordinates(endRow, endCol);
IsMatch = true;
}
public override string ToString()
=> $"{Word} found at {StartPos} to {EndPos} direction {Direction}";
}
private class Coordinates
{
public readonly int Row;
public readonly int Col;
public Coordinates(int row, int col)
{
Row = row;
Col = col;
}
public override string ToString() => $"({Row}, {Col})";
}
// This function searches in all 8-direction
// from point (row, col) in grid[, ]
static Task Search2D(char[,] Grid, int row, int col, string word) => Task.Run(() =>
{
// If first character of word doesn't match
// with given starting point in grid.
if (Grid[row, col] != word[0])
{
return new WordMatch();
}
int len = word.Length;
int rows = Grid.GetLength(0);
int cols = Grid.GetLength(1);
int k, rd, cd;
// Search word in all 8 directions
// starting from (row, col)
for (int dir = 0; dir < 8; dir++)
{
// Initialize starting point
// for current direction
k = 1;
rd = row;
cd = col;
// First character is already checked,
// match remaining characters
while (k < len)
{
// Moving in particular direction
rd += x[dir];
cd += y[dir];
// If out of bound break
if (rd >= rows || rd < 0 || cd >= cols || cd < 0)
{
break;
}
// If not matched, break
if (Grid[rd, cd] != word[k])
{
break;
}
k++;
}
// If all character matched, then value of k
// must be equal to length of word
if (k == len)
{
return new WordMatch(word, row, col, dir, rd, cd);
}
}
return new WordMatch();
});
// Searches given word in a given
// matrix in all 8 directions
static void PatternSearch(char[,] Grid, string word)
{
List> tasks = new List>();
// Consider every point as starting
// point and search given word
for (int row = 0; row < Grid.GetLength(0); row++)
{
for (int col = 0; col < Grid.GetLength(1); col++)
{
tasks.Add(Search2D(Grid, row, col, word));
}
}
Task.WaitAll(tasks.ToArray());
tasks.Select(x => x.Result)
.Where(x => x.IsMatch)
.ToList()
.ForEach(x => Console.WriteLine(x));
}
static void Main(string[] args)
{
Console.WriteLine("Word Search");
for (int y = 0; y < Grid.GetLength(0); y++)
{
for (int x = 0; x < Grid.GetLength(1); x++)
{
Console.Write(Grid[y, x]);
Console.Write(' ');
}
Console.WriteLine();
}
Console.WriteLine("");
Console.WriteLine("Found Words");
Console.WriteLine("------------------------------");
foreach (string word in Words)
{
PatternSearch(Grid, word);
Console.WriteLine();
}
Console.WriteLine("------------------------------");
Console.WriteLine("");
Console.WriteLine("Press any key to end");
Console.ReadKey();
}
}
}

2 Replies

Know the answer? Post it — somebody with the same question will find it here.

Rijwan Ansari5y ago
Check this if you can get idea.
https://www.codeproject.com/Articles/1136695/A-Complete-Word-Puzzle-Game-in-Csharp-NET
0
Mario Scheeren5y ago
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;

namespace CmdWordSearch
{
    class Program
    {
        // For searching in all 8 direction
        static int[] x = { -1, -1, -1, 0, 0, 1, 1, 1 };
        static int[] y = { -1, 0, 1, -1, 1, -1, 0, 1 };
        static char[,] Grid = new char[,] {
            {'C', 'P', 'K', 'X', 'O', 'I', 'G', 'H', 'S', 'F', 'C', 'H'},
            {'Y', 'G', 'W', 'R', 'I', 'A', 'H', 'C', 'Q', 'R', 'X', 'K'},
            {'M', 'A', 'X', 'I', 'M', 'I', 'Z', 'A', 'T', 'I', 'O', 'N'},
            {'E', 'T', 'W', 'Z', 'N', 'L', 'W', 'G', 'E', 'D', 'Y', 'W'},
            {'M', 'C', 'L', 'E', 'L', 'D', 'N', 'V', 'L', 'G', 'P', 'T'},
            {'O', 'J', 'A', 'A', 'V', 'I', 'O', 'T', 'E', 'E', 'P', 'X'},
            {'C', 'D', 'B', 'P', 'H', 'I', 'A', 'W', 'V', 'X', 'U', 'I'},
            {'L', 'G', 'O', 'S', 'S', 'B', 'R', 'Q', 'I', 'A', 'P', 'K'},
            {'E', 'O', 'I', 'G', 'L', 'P', 'S', 'D', 'S', 'F', 'W', 'P'},
            {'W', 'F', 'K', 'E', 'G', 'O', 'L', 'F', 'I', 'F', 'R', 'S'},
            {'O', 'T', 'R', 'U', 'O', 'C', 'D', 'O', 'O', 'F', 'T', 'P'},
            {'C', 'A', 'R', 'P', 'E', 'T', 'R', 'W', 'N', 'G', 'V', 'Z'}
        };

        static string[] Words = new string[]
        {
            "CARPET",
            "CHAIR",
            "DOG",
            "BALL",
            "DRIVEWAY",
            "FISHING",
            "FOODCOURT",
            "FRIDGE",
            "GOLF",
            "MAXIMIZATION",
            "PUPPY",
            "SPACE",
            "TABLE",
            "TELEVISION",
            "WELCOME",
            "WINDOW"
        };

        private class WordMatch
        {
            public readonly bool IsMatch;
            public readonly string Word;
            public readonly int Direction;
            public readonly Coordinates StartPos;
            public readonly Coordinates EndPos;

            public WordMatch()
            {
                IsMatch = false;
            }

            public WordMatch(string word, int startRow, int startCol, int direction, int endRow, int endCol)
            {
                Word = word;
                StartPos = new Coordinates(startRow, startCol);
                Direction = direction;
                EndPos = new Coordinates(endRow, endCol);
                IsMatch = true;
            }

            public override string ToString()
                => $"{Word} found at {StartPos} to {EndPos} direction {Direction}";
        }

        private class Coordinates
        {
            public readonly int Row;
            public readonly int Col;
            public Coordinates(int row, int col)
            {
                Row = row;
                Col = col;
            }
            public override string ToString() => $"({Row}, {Col})";
        }

        // This function searches in all 8-direction
        // from point (row, col) in grid[, ]
        static Task Search2D(char[,] Grid, int row, int col, string word) => Task.Run(() =>
        {
            // If first character of word doesn't match
            // with given starting point in grid.
            if (Grid[row, col] != word[0])
            {
                return new WordMatch();
            }

            int len = word.Length;
            int rows = Grid.GetLength(0);
            int cols = Grid.GetLength(1);
            int k, rd, cd;

            // Search word in all 8 directions
            // starting from (row, col)
            for (int dir = 0; dir < 8; dir++)
            {
                // Initialize starting point
                // for current direction
                k = 1;
                rd = row;
                cd = col;

                // First character is already checked,
                // match remaining characters
                while (k < len)
                {
                    // Moving in particular direction
                    rd += x[dir];
                    cd += y[dir];

                    // If out of bound break
                    if (rd >= rows || rd < 0 || cd >= cols || cd < 0)
                    {
                        break;
                    }

                    // If not matched, break
                    if (Grid[rd, cd] != word[k])
                    {
                        break;
                    }

                    k++;
                }

                // If all character matched, then value of k
                // must be equal to length of word
                if (k == len)
                {
                    return new WordMatch(word, row, col, dir, rd, cd);
                }
            }

            return new WordMatch();
        });

        // Searches given word in a given
        // matrix in all 8 directions
        static void PatternSearch(char[,] Grid, string word)
        {
            List> tasks = new List>();
            // Consider every point as starting
            // point and search given word
            for (int row = 0; row < Grid.GetLength(0); row++)
            {
                for (int col = 0; col < Grid.GetLength(1); col++)
                {
                    tasks.Add(Search2D(Grid, row, col, word));
                }
            }

            Task.WaitAll(tasks.ToArray());
            tasks.Select(x => x.Result)
                .Where(x => x.IsMatch)
                .ToList()
                .ForEach(x => Console.WriteLine(x));
        }

        static void Main(string[] args)
        {
            Console.WriteLine("Word Search");

            for (int y = 0; y < Grid.GetLength(0); y++)
            {
                for (int x = 0; x < Grid.GetLength(1); x++)
                {
                    Console.Write(Grid[y, x]);
                    Console.Write(' ');
                }
                Console.WriteLine();
            }

            Console.WriteLine("");
            Console.WriteLine("Found Words");
            Console.WriteLine("------------------------------");

            foreach (string word in Words)
            {
                PatternSearch(Grid, word);
                Console.WriteLine();
            }

            Console.WriteLine("------------------------------");
            Console.WriteLine("");
            Console.WriteLine("Press any key to end");
            Console.ReadKey();
        }
    }
}
0