boggleNet

@@ -1,166 +0,0 @@

-//#define DEVELOPING

-

-using System;

-using System.Collections.Generic;

-using System.IO;

-using System.Diagnostics;

-

-namespace Boggle

-{

-    public class Boggle

-    {

-        static void PrintWords(HashSet<WordOnBoard> words)

-        {

-            int score = 0;

-            foreach (WordOnBoard word in words)

-            {

-                Console.Write("{0} [{1}], ", word.Word, word.Score);

-                score += word.Score;

-            }

-            Console.WriteLine("\n\nTotal score for this board: {0}", score);

-        }

-        static void Main(string[] args)

-        {

-            Stopwatch st = new Stopwatch();

-            BoggleList bl = new BoggleList();

-            Console.WriteLine("Current directory: {0}", Directory.GetCurrentDirectory());

-#if !DEVELOPING

-            string input;

-            bool isError = false;

-#endif

-            int boardSideLength = 3;

-            int minWordLength = 4;

-

-            char wordListInput = 'Z';

-            BoggleLists listToUseForLookup;

-            

-#if !DEVELOPING

-            do

-            {

-                isError = false;

-                Console.WriteLine("Please enter the word list that you wish to use [Z for Zingarelli, T for TWS or standard scrabble list]: ");

-                input = Console.ReadLine();

-                if (!char.TryParse(input, out wordListInput))

-                {

-                    Console.WriteLine("Invalid Input. Couldn't parse character");

-                    isError = true;

-                }

-                wordListInput = char.ToUpper(wordListInput);

-                if (wordListInput != 'T' && wordListInput != 'Z')

-                {

-                    Console.WriteLine("Please enter only T or Z.");

-                    isError = true;

-                }

-            } while (isError);

-#endif

-            switch (wordListInput)

-            {

-                case 'T':

-                    listToUseForLookup = BoggleLists.TWS;

-                    break;

-

-                case 'Z':

-                    listToUseForLookup = BoggleLists.ZINGARELLI;

-                    break;

-                default:

-                    throw new Exception("Unexpected!!");

-            }

-

-#if !DEVELOPING

-            do

-            {

-                isError = false;

-                Console.WriteLine("Please enter number of tiles that make up one side of the board: ");

-                input = Console.ReadLine();

-                if (!int.TryParse(input, out boardSideLength))

-                {

-                    Console.WriteLine("Invalid Input.");

-                    isError = true;

-                }

-            } while (isError);

-

-            do

-            {

-                isError = false;

-                Console.WriteLine("Please enter number of ALPHABETS that should be there in shortest word: ");

-                input = Console.ReadLine();

-                if (!int.TryParse(input, out minWordLength))

-                {

-                    Console.WriteLine("Invalid Input.");

-                    isError = true;

-                }

-            } while (isError);

-#endif

-            st.Start();

-            bl.LoadList(listToUseForLookup, boardSideLength, minWordLength, Directory.GetCurrentDirectory());

-            st.Stop();

-            Console.WriteLine("Loaded list in {0} ms.", st.ElapsedMilliseconds);

-

-            string boardString = "qwertyuio";

-#if !DEVELOPING

-            do

-            {

-                isError = false;

-                Console.WriteLine("Please enter the characters on board in row first fashion ({0} expected characters): ", boardSideLength*boardSideLength);

-                boardString = Console.ReadLine();

-                if (boardString.Length != boardSideLength*boardSideLength)

-                {

-                    Console.WriteLine("Invalid Input. Q will be translated to QU internally. Please enter only Q if you want to enter the QU tile.");

-                    isError = true;

-                }

-            } while (isError);

-#endif

-            boardString = boardString.ToUpper();

-

-            BoggleBoard board = new BoggleBoard(boardSideLength, boardString);

-            board.Print();

-            BoggleSolver solution = new BoggleSolver(board, bl, minWordLength);

-            st.Start();

-            //HashSet<WordOnBoard> wordsUnThreaded = solution.GetWordsOnBoard(false);

-            //st.Stop();

-            //PrintWords(wordsUnThreaded);

-

-            //Console.WriteLine("Got solution in {0} ms. Number of words (unthreaded): {1}", st.ElapsedMilliseconds, wordsUnThreaded.Count);

-            //Console.WriteLine("Press any key to run in threaded mode.");

-            //Console.ReadKey();

-            st.Start();

-            HashSet<WordOnBoard> wordsThreaded = solution.GetWordsOnBoard(true);

-            //wordsThreaded.ExceptWith(wordsUnThreaded);

-            st.Stop();

-            st.Reset();

-            PrintWords(wordsThreaded);

-            Console.WriteLine("Got solution in {0} ms. Number of words (threaded): {1}.", st.ElapsedMilliseconds, wordsThreaded.Count);

-

-            

-

-

-            //if (wordsUnThreaded.Count > wordsThreaded.Count)

-            //{

-            //    wordsUnThreaded.ExceptWith(wordsThreaded);

-            //    Console.WriteLine("Words in unthreaded collection that are not in threaded collection:");

-            //    PrintWords(wordsUnThreaded);

-            //}

-            //if (wordsThreaded.Count > wordsUnThreaded.Count)

-            //{

-            //    wordsThreaded.ExceptWith(wordsUnThreaded);

-            //    Console.WriteLine("Words in threaded collection that are not in unthreaded collection:");

-            //    PrintWords(wordsThreaded);

-            //}

-

-            //wordsUnThreaded.RemoveWhere(WordsWithLowestScore);

-            //Console.WriteLine("***Removed words with score 1.***");

-            //PrintWords(wordsUnThreaded);

-            Console.ReadKey();

-        }

-

-        private static bool WordsWithLowestScore(WordOnBoard word)

-        {

-            if (word.Score == Constants.MIN_SCORE)

-            {

-                return true;

-            }

-

-            return false;

-        }

-    }

-}

@@ -1,71 +0,0 @@

-<?xml version="1.0" encoding="utf-8"?>

-<Project ToolsVersion="4.0" DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">

-  <PropertyGroup>

-    <Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>

-    <Platform Condition=" '$(Platform)' == '' ">x86</Platform>

-    <ProductVersion>8.0.30703</ProductVersion>

-    <SchemaVersion>2.0</SchemaVersion>

-    <ProjectGuid>{AB752D5B-37CC-4029-8621-FA970CDD5E2A}</ProjectGuid>

-    <OutputType>Exe</OutputType>

-    <AppDesignerFolder>Properties</AppDesignerFolder>

-    <RootNamespace>Boggle</RootNamespace>

-    <AssemblyName>Boggle</AssemblyName>

-    <FileAlignment>512</FileAlignment>

-  </PropertyGroup>

-  <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|x86' ">

-    <PlatformTarget>x86</PlatformTarget>

-    <DebugSymbols>true</DebugSymbols>

-    <DebugType>full</DebugType>

-    <Optimize>false</Optimize>

-    <OutputPath>bin\Debug\</OutputPath>

-    <DefineConstants>DEBUG;TRACE</DefineConstants>

-    <ErrorReport>prompt</ErrorReport>

-    <WarningLevel>4</WarningLevel>

-  </PropertyGroup>

-  <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release|x86' ">

-    <PlatformTarget>x86</PlatformTarget>

-    <DebugType>pdbonly</DebugType>

-    <Optimize>true</Optimize>

-    <OutputPath>bin\Release\</OutputPath>

-    <DefineConstants>TRACE</DefineConstants>

-    <ErrorReport>prompt</ErrorReport>

-    <WarningLevel>4</WarningLevel>

-  </PropertyGroup>

-  <ItemGroup>

-    <Reference Include="System" />

-    <Reference Include="System.Core" />

-    <Reference Include="System.Xml.Linq" />

-    <Reference Include="System.Data.DataSetExtensions" />

-    <Reference Include="Microsoft.CSharp" />

-    <Reference Include="System.Data" />

-    <Reference Include="System.Xml" />

-  </ItemGroup>

-  <ItemGroup>

-    <Compile Include="Boggle.cs" />

-    <Compile Include="BoggleBoard.cs" />

-    <Compile Include="BoggleList.cs" />

-    <Compile Include="BoggleSolver.cs" />

-    <Compile Include="Constants.cs" />

-    <Compile Include="ListWord.cs" />

-    <Compile Include="Properties\AssemblyInfo.cs" />

-    <Compile Include="Tile.cs" />

-    <Compile Include="WordComparer.cs" />

-    <Compile Include="WordOnBoard.cs" />

-  </ItemGroup>

-  <ItemGroup>

-    <Content Include="wordlists\TWL06.txt">

-      <CopyToOutputDirectory>Always</CopyToOutputDirectory>

-    </Content>

-    <Content Include="wordlists\zingarelli2005.txt">

-      <CopyToOutputDirectory>Always</CopyToOutputDirectory>

-    </Content>

-  </ItemGroup>

-  <Import Project="$(MSBuildToolsPath)\Microsoft.CSharp.targets" />

-  <!-- To modify your build process, add your task inside one of the targets below and uncomment it. 

-       Other similar extension points exist, see Microsoft.Common.targets.

-  <Target Name="BeforeBuild">

-  </Target>

-  <Target Name="AfterBuild">

-  </Target>

-  -->

-</Project>

\ No newline at end of file

@@ -1,6 +0,0 @@

-<?xml version="1.0" encoding="utf-8"?>

-<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">

-  <PropertyGroup>

-    <ProjectView>ProjectFiles</ProjectView>

-  </PropertyGroup>

-</Project>

\ No newline at end of file

@@ -1,20 +0,0 @@

-

-Microsoft Visual Studio Solution File, Format Version 11.00

-# Visual Studio 2010

-Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "Boggle", "Boggle.csproj", "{AB752D5B-37CC-4029-8621-FA970CDD5E2A}"

-EndProject

-Global

-	GlobalSection(SolutionConfigurationPlatforms) = preSolution

-		Debug|x86 = Debug|x86

-		Release|x86 = Release|x86

-	EndGlobalSection

-	GlobalSection(ProjectConfigurationPlatforms) = postSolution

-		{AB752D5B-37CC-4029-8621-FA970CDD5E2A}.Debug|x86.ActiveCfg = Debug|x86

-		{AB752D5B-37CC-4029-8621-FA970CDD5E2A}.Debug|x86.Build.0 = Debug|x86

-		{AB752D5B-37CC-4029-8621-FA970CDD5E2A}.Release|x86.ActiveCfg = Release|x86

-		{AB752D5B-37CC-4029-8621-FA970CDD5E2A}.Release|x86.Build.0 = Release|x86

-	EndGlobalSection

-	GlobalSection(MonoDevelopProperties) = preSolution

-		StartupItem = Boggle.csproj

-	EndGlobalSection

-EndGlobal

@@ -1,128 +0,0 @@

-using System;

-using System.Text;

-

-namespace Boggle

-{

-    public class BoggleBoard

-    {

-        private readonly Tile[,] _Tiles;

-        /// <summary>

-        /// A 2D array containing all the tles in the board.

-        /// This is a read only propert

-        /// </summary>

-        public Tile[,] Tiles

-        {

-            get

-            {

-                return _Tiles;

-            }

-        }

-

-        private readonly int _SideLength;

-        /// <summary>

-        /// Number of tiles in one side of the square board.

-        /// This is a read only property.

-        /// </summary>

-        public int SideLength

-        {

-            get

-            {

-                return _SideLength;

-            }

-        }

-

-        /// <summary>

-        /// BoggleBoard constructor.

-        /// </summary>

-        /// <param name="sideLength">Number of TILES that make up the side of the board.</param>

-        /// <param name="letters">String containing alphabets in row first order.</param>

-        public BoggleBoard(int sideLength, string letters)

-        {

-            if (sideLength < Constants.MIN_SIDE_LENGTH)

-            {

-                throw new ArgumentException(string.Format("Length of side of board has to be greater than or equal to {0}", Constants.MIN_SIDE_LENGTH));

-            }

-

-            int numTiles = sideLength * sideLength;

-

-            if (letters.Length != numTiles)

-            {

-                throw new ArgumentException(string.Format("Board's initialization string contains {0} characters. {1} characters were expected. 'Q' tranlates to 'QU' internally and only 'Q' needs to be mentioned.", letters.Length, numTiles));

-            }

-            _SideLength = sideLength;

-            _Tiles = new Tile[_SideLength, _SideLength];

-

-            //row-first addition = manner in which humans read.

-            string alphabet;

-            for (int i = 0; i < sideLength; i++)

-            {

-                for (int j = 0; j < sideLength; j++)

-                {

-                    alphabet = letters.Substring(i * sideLength + j, 1);

-                    //the special condition

-                    if (alphabet == "Q")

-                        alphabet += "U";

-                    _Tiles[j, i] = new Tile(j, i, alphabet);

-                }

-            }

-        }

-

-        /// <summary>

-        /// Copy constructor.

-        /// </summary>

-        /// <param name="orignalBoard">Board to copy.</param>

-        public BoggleBoard(BoggleBoard orignalBoard)

-        {

-            _SideLength = orignalBoard._SideLength;

-            _Tiles = new Tile[_SideLength, _SideLength];

-            for (int i = 0; i < _SideLength; i++)

-            {

-                for (int j = 0; j < _SideLength; j++)

-                {

-                    _Tiles[i, j] = new Tile(i, j, orignalBoard.Tiles[i, j].Alphabet);

-                }

-            }

-        }

-

-        /// <summary>

-        /// Indexer to allow more natural access to tiles in the board.

-        /// </summary>

-        /// <param name="x">X co-ordinate of the tile in the board.</param>

-        /// <param name="y">Y co-ordinate of the tile in the board.</param>

-        /// <returns>Tile at x, y co-ordinate.</returns>

-        public Tile this[int x, int y]

-        {

-            get

-            {

-                return _Tiles[x, y];

-            }

-        }

-

-        /// <summary>

-        /// Prints out the board on console.

-        /// </summary>

-        public void Print()

-        {

-            int horizontalLength = _SideLength * 4 + 1;

-            StringBuilder line = new StringBuilder(horizontalLength);

-            string horizontalSeparator = string.Empty;

-            for (int i = 0; i < horizontalLength; i++)

-            {

-                horizontalSeparator += "\u2550";

-            }

-

-            for (int i = 0; i < _SideLength; i++)

-            {

-                Console.WriteLine(horizontalSeparator);

-                line.Clear();

-                line.Append("\u2551");

-                for (int j = 0; j < _SideLength; j++)

-                {

-                    line.AppendFormat(" {0} \u2551", _Tiles[j, i].Alphabet);

-                }

-                Console.WriteLine(line);

-            }

-            Console.WriteLine(horizontalSeparator);

-        }

-    }

-}

@@ -1,226 +0,0 @@

-using System;

-using System.Collections.Generic;

-using System.IO;

-

-namespace Boggle

-{

-    /// <summary>

-    /// Supported lists.

-    /// </summary>

-    public enum BoggleLists

-    {

-        /// <summary>

-        /// Scrabble dictionary for USA, Canada and Thailand

-        /// </summary>

-        TWS,

-

-        /// <summary>

-        /// Scrabble dictionary used world wide except in USA, Canada and Thailand.

-        /// </summary>

-        //SOWPODS,

-

-        /// <summary>

-        /// A huge dictionary found on official Internet Scrabble Club's website (http://www.isc.ro/en/commands/lists.html)

-        /// </summary>

-        ZINGARELLI

-    }

-

-    public class BoggleList

-    {

-        /// <summary>

-        /// Contains a hybrid tree that has been optimized for recursive search.

-        /// </summary>

-        private Dictionary<string, ListWord> _WordList = new Dictionary<string, ListWord>(27); //top level will store only 3 letter words or substrings. Declaring proper size makes insertion operation O(1)

-        public Dictionary<string, ListWord> Wordlist

-        {

-            get

-            {

-                return _WordList;

-            }

-        }

-

-        /// <summary>

-        /// Contains a list of dictionaries that have been loaded, indexed by enum that contains dictionaries we support.

-        /// </summary>

-        private Dictionary<BoggleLists, Dictionary<string, ListWord>> _LoadedDictionaries;

-

-        /// <summary>

-        /// Determines if we have an absolute path

-        /// </summary>

-        /// <param name="filePath">File that contains the list SORTED list of words. Path can be relative or absolute.</param>

-        /// <returns>The absolute file path that we can use to access it.</returns>

-        private string GetAbsoluteFilePath(string filePath)

-        {

-            //check if the absolute file path exists.            

-            if (!File.Exists(filePath))

-            {

-                //try checking if this is a relative file path and prepend current directory's path.

-                filePath = string.Format("{0}\\{1}", Directory.GetCurrentDirectory(), filePath);

-                if (!File.Exists(filePath))

-                {

-                    filePath = string.Empty;

-                }

-            }

-

-            return filePath;

-        }

-

-        /// <summary>

-        /// Curates the list for use by this solver. Basically culls out words that do not meet the criteria.

-        /// Criteria: Min_word_length < word_length < Max_word_length. Max_word_length = sideLength^2 + 1.

-        /// </summary>

-        /// <param name="filePath"> Path to file that contains the SORTED list of words. 

-        ///                         It can be relative to current execution directory or absolute.</param>

-        /// <param name="boardSideLength">Length of the side of board in number of tiles.</param>

-        /// <param name="minWordLength">Number of alphabets that can be there in the shortest word on the board.</param>

-        private void CurateList(string filePath, int boardSideLength, int minWordLength)

-        {

-            //filePath = GetAbsoluteFilePath(filePath);

-            //true tells stream reader to auto detect encoding of the file.

-            StreamReader rawList = new StreamReader(filePath, true);

-            //Create a new file. Do not append anything.

-            string curatedFilePath = string.Format("{0}.{1}.{2}", filePath, Constants.CURATED_FILE_SUFFIX, minWordLength.ToString());

-            StreamWriter curatedList = new StreamWriter(curatedFilePath, false);

-

-            string word;

-            //write out the words whose number of characters are between the shortest and largest provided length.

-            while ((word = rawList.ReadLine()) != null)

-            {

-                if (word.Length >= minWordLength && word.Length <= boardSideLength * boardSideLength + 1)

-                {

-                    curatedList.WriteLine(word);

-                }

-            }

-

-            curatedList.Flush();

-            curatedList.Close();

-            rawList.Close();

-        }

-

-        public BoggleList()

-        {

-            //Initialize the dictionary containing the lists.

-            _LoadedDictionaries = new Dictionary<BoggleLists, Dictionary<string, ListWord>>(Enum.GetNames(typeof(BoggleLists)).Length);

-        }

-

-        /// <summary>

-        /// Loads the list depending on the selected dictionary.

-        /// </summary>

-        /// <param name="dict">Type of dictionary to load.</param>

-        /// <param name="boardSideLength"></param>

-        /// <param name="minWordLength"></param>

-        /// <returns>A hybird tree containing the words with each level containing one alphabet (or QU)</returns>

-        public Dictionary<string, ListWord> LoadList(BoggleLists dict, int boardSideLength, int minWordLength, string listRootPath)

-        {

-            if (_LoadedDictionaries.ContainsKey(dict))

-                return _LoadedDictionaries[dict];

-

-            string filePath = string.Empty;

-

-            if (NeedsCuration(dict, minWordLength, listRootPath, ref filePath))

-                CurateList(filePath, boardSideLength, minWordLength);

-

-            _WordList = new Dictionary<string, ListWord>(27);

-

-            //true tells stream reader to auto detect encoding of the file.

-            StreamReader rawList = new StreamReader(filePath, true);

-            string word, substring;

-            ListWord prevListWord;

-            int startIndex;

-

-            while ((word = rawList.ReadLine()) != null)

-            {

-                //First deal with the head node and then deal with following letters.

-                startIndex = 0;

-                word = word.ToUpper();

-                substring = word.Substring(0, 1);

-                //if the string starts with Q and there is a 'U' following it, then put QU on tile and increment starting index accordingly.

-                if (substring == "Q" && word[1] == 'U')

-                {

-                    substring += "U";

-                    startIndex++;

-                }

-

-                //If there is no space allocated for this letter at root level, allocate some.

-                if (!_WordList.ContainsKey(substring))

-                {

-                    _WordList.Add(substring, new ListWord());

-                }

-                prevListWord = _WordList[substring];

-

-                //fit the word in the tree structure

-                for (int i = startIndex + 1; i < word.Length; i++)

-                {

-                    //We are dealing with one letter at each level

-                    substring = word.Substring(i, 1);

-                    //But if the letter is Q and there is a U following it, then treat this as one letter.

-                    if (substring == "Q" && i + 1 < word.Length && word[i + 1] == 'U')

-                    {

-                        substring += "U";

-                        //also increment the index as we have consumed the next letter.

-                        i++;

-                    }

-                    //Has this combination of letters appeared before?

-                    if (prevListWord.Next == null)

-                    {

-                        //if not, then make some space to store this combination

-                        prevListWord.Next = new Dictionary<string, ListWord>(27);

-                        //and store it.

-                        prevListWord.Next.Add(substring, new ListWord());

-                    }

-                    //if it has,

-                    else if (!prevListWord.Next.ContainsKey(substring))

-                    {

-                        //then just store it.

-                        prevListWord.Next.Add(substring, new ListWord());

-                    }

-

-                    //Update the dictionary to point to current substring's last character/entry in the tree.

-                    prevListWord = prevListWord.Next[substring];

-                }

-                //set the value of the leaf node to be true to point that we have completed the word.

-                prevListWord.IsWord = true;

-            }

-

-            //Store it in the collection 

-            _LoadedDictionaries.Add(dict, _WordList);

-            return _WordList;

-        }

-

-        /// <summary>

-        /// Checks to see if the proper file exists that contains the appropriate words.

-        /// </summary>

-        /// <param name="list">Type of list to check for.</param>

-        /// <param name="minWordLength">Minimum number of LETTERS the word should contain. </param>

-        /// <param name="filePath">Reference to path of file. If the list will need curation, it will store path to source list. 

-        /// If list is there, it will store the path to the curated list.</param>

-        /// <returns>Whether there is a need to run the curation procedure or not.</returns>

-        private bool NeedsCuration(BoggleLists list, int minWordLength, string wordlistContainer, ref string filePath)

-        {

-            bool needsCuration = false;

-            switch (list)

-            {

-                case BoggleLists.TWS:

-                    filePath = GetAbsoluteFilePath(string.Format("{0}/{1}.{2}.{3}", filePath, Constants.TWS_FILE_PATH, Constants.CURATED_FILE_SUFFIX, minWordLength.ToString()));

-                    if (filePath == string.Empty)

-                    {

-                        filePath = string.Format("{0}/{1}", wordlistContainer, Constants.TWS_FILE_PATH);

-                        needsCuration = true;

-                    }

-                    break;

-                case BoggleLists.ZINGARELLI:

-                    filePath = GetAbsoluteFilePath(string.Format("{0}/{1}.{2}.{3}", filePath, Constants.ZINGARELLI_FILE_PATH, Constants.CURATED_FILE_SUFFIX, minWordLength.ToString()));

-                    if (filePath == string.Empty)

-                    {

-                        filePath = string.Format("{0}/{1}", wordlistContainer, Constants.ZINGARELLI_FILE_PATH);

-                        needsCuration = true;

-                    }

-                    break;

-                default:

-                    throw new ArgumentException(string.Format("Support for {0} wordlist has not been coded yet :(", list));

-            }

-

-            return needsCuration;

-        }

-    }

-}

@@ -1,206 +0,0 @@

-using System;

-using System.Collections.Generic;

-using System.Text;

-using System.Threading;

-

-namespace Boggle

-{

-    public class BoggleSolver

-    {

-        BoggleList _WordList;

-        WordComparer _wordEqualityComparer;

-        BoggleBoard _Board;

-        int _MinWordLength;

-        HashSet<WordOnBoard> _wordsOnBoard;

-

-        /// <summary>

-        /// Constructor.

-        /// </summary>

-        /// <param name="board">Board on which we need to run the solution,</param>

-        /// <param name="words">List of valid words.</param>

-        /// <param name="minWordLength">Length of smallest word in number of tiles.</param>

-        public BoggleSolver(BoggleBoard board, BoggleList words, int minWordLength)

-        {

-            _Board = board;

-            _WordList = words;

-            _MinWordLength = minWordLength;

-            _wordEqualityComparer = new WordComparer();

-            _wordsOnBoard = new HashSet<WordOnBoard>(_wordEqualityComparer);

-        }

-

-        /// <summary>

-        /// Get the set of words existing on the board.

-        /// </summary>

-        /// <returns>Set of words on the board. We are using a Hashset because it automatically takes care of duplicate words.</returns>

-        public HashSet<WordOnBoard> GetWordsOnBoard(bool useThreads = false)

-        {

-            if (!useThreads)

-                return GetWordsOnBoardNoThreads();

-

-            return GetWordsOnBoardThreaded();

-        }

-

-        private ManualResetEvent[] doneEvents;

-

-        /// <summary>

-        /// Entry point for getting all possible words on board in threaded manner.

-        /// </summary>

-        /// <returns>Hashset of all words that can appear on the board.</returns>

-        private HashSet<WordOnBoard> GetWordsOnBoardThreaded()

-        {

-            doneEvents = new ManualResetEvent[_Board.SideLength * _Board.SideLength];

-            for (int i = 0; i < _Board.SideLength; i++)

-            {

-                for (int j = 0; j < _Board.SideLength; j++)

-                {

-                    doneEvents[i * _Board.SideLength + j] = new ManualResetEvent(false);

-

-                    ThreadPool.QueueUserWorkItem(CollectWordsFromPivotThreaded, _Board[i, j]);

-                }

-            }

-            WaitHandle.WaitAll(doneEvents);

-            return _wordsOnBoard;

-        }

-

-        private void CollectWordsFromPivotThreaded(Object obj)

-        {

-            Tile passedTile = (Tile)obj;

-            //Copy the board

-            BoggleBoard boardForThisThread = new BoggleBoard(this._Board);

-            //Initialize a list that will hold the tiles that will make up the word. Its max size will be square of side.

-            List<Tile> newWordList = new List<Tile>(boardForThisThread.SideLength * boardForThisThread.SideLength);

-            //Figure out the tile in the new board

-            Tile t = boardForThisThread[passedTile.X, passedTile.Y];

-            //Initialize this list with the tile that we will start finding words from.

-            newWordList.Add(t);

-            //Collect all the possible words from this tile. End result should be in the Hashset.

-            CollectWordsFromPivot(boardForThisThread, _WordList.Wordlist[t.Alphabet].Next, newWordList);

-            doneEvents[t.X * _Board.SideLength + t.Y].Set();

-        }

-

-        private HashSet<WordOnBoard> GetWordsOnBoardNoThreads()

-        {

-            for (int i = 0; i < _Board.SideLength; i++)

-            {

-                for (int j = 0; j < _Board.SideLength; j++)

-                {

-                    //Collect all the tiles that make up the word.

-                    List<Tile> newWordList = new List<Tile>(_Board.SideLength * _Board.SideLength);

-                    //Initialize this list with the tile that we will start finding words from.

-                    newWordList.Add(_Board[i, j]);

-                    //Collect all the possible words from this tile. End result should be in the Hashset.

-                    CollectWordsFromPivot(this._Board, _WordList.Wordlist[_Board[i, j].Alphabet].Next, newWordList);

-                    //Set everything visited to false so that next traversal has the proper state.

-                    ResetBoard();

-                }

-            }

-

-            return _wordsOnBoard;

-        }

-

-        /// <summary>

-        /// Sets IsVisited of every tile in the board to false.

-        /// </summary>

-        private void ResetBoard()

-        {

-            for (int i = 0; i < _Board.SideLength; i++)

-            {

-                for (int j = 0; j < _Board.SideLength; j++)

-                {

-                    _Board[i, j].IsVisited = false;

-                }

-            }

-

-        }

-

-        /// <summary>

-        /// Extracts the word from tiles and stores it in a synchronized fashion.

-        /// </summary>

-        /// <param name="wordTiles">Tiles making up the word.</param>

-        private void StoreWord(List<Tile> wordTiles)

-        {

-            StringBuilder builder = new StringBuilder(wordTiles[0].Alphabet);

-            for (int i = 1; i < wordTiles.Count; i++)

-            {

-                builder.Append(wordTiles[i].Alphabet);

-            }

-

-            string word = builder.ToString();

-            int score = Constants.MIN_SCORE;

-            if (word.Length <= _MinWordLength + 1)

-                score = Constants.MIN_SCORE;

-            else if (word.Length == _MinWordLength + 2)

-                score = Constants.MIN_SCORE + 1;

-            else if (word.Length == _MinWordLength + 3)

-                score = Constants.MIN_SCORE + 2;

-            else if (word.Length == _MinWordLength + 4)

-                score = Constants.MIN_SCORE + 4;

-            else 

-                score = Constants.MIN_SCORE + 10;

-

-            lock (_wordsOnBoard)

-            {

-                _wordsOnBoard.Add(new WordOnBoard(word, score));

-            }

-        }

-

-        /// <summary>

-        /// Recursive function to get all the possible words from a tile.

-        /// </summary>

-        /// <param name="t">Tile that needs to be analyzed for words.</param>

-        /// <param name="validNextSubstrings">A dictionary containing all letters that can come after the one contained in the tile.</param>

-        /// <param name="currentSubstring">List of tiles that make up all or part of the word.</param>

-        private void CollectWordsFromPivot(BoggleBoard board, Dictionary<string, ListWord> validNextSubstrings, List<Tile> currentSubstring)

-        {

-            Tile t = currentSubstring[currentSubstring.Count - 1];

-            t.IsVisited = true;

-

-            string validWord = string.Empty;

-

-            int adjPosX = -1, adjPosY = -1;

-            for (int x = -1; x <= 1; x++)

-            {

-                adjPosX = t.X + x;

-                if (adjPosX < 0 || adjPosX >= board.SideLength) //we don't want to hit anything outside the boundries of the board.

-                    continue;

-

-                for (int y = -1; y <= 1; y++)

-                {

-                    adjPosY = t.Y + y;

-                    if (adjPosY < 0 || adjPosY >= board.SideLength || (adjPosX == t.X && adjPosY == t.Y))    //in third condition, it will  point to itself and we dont want that

-                        continue;

-

-                    Tile adjacentTile = board[adjPosX, adjPosY];

-                    //no need to parse the tile if it has been already visited or there is no word possible with current string

-                    if (adjacentTile.IsVisited || !validNextSubstrings.ContainsKey(adjacentTile.Alphabet))

-                        continue;

-

-                    //either we now have a word or have a part of the word

-                    currentSubstring.Add(adjacentTile);

-

-                    //if we have the complete word that has minimum word length we require, add it to the hashet of words

-                    if (validNextSubstrings[adjacentTile.Alphabet].IsWord && currentSubstring.Count >= _MinWordLength)

-                        StoreWord(currentSubstring);

-

-                    //now we want to see if there is any good reason to proceed with passing control to the adjacent tile.

-                    Dictionary<string, ListWord> validNextSubstringsAdjTile = validNextSubstrings[adjacentTile.Alphabet].Next;

-

-                    //there will no more words to make after this... no need to recurse.

-                    if (validNextSubstringsAdjTile == null)

-                    {

-                        //remove the alphabet just added from the end of the string as it will not be hitting the appropriate statement later.

-                        currentSubstring.RemoveAt(currentSubstring.Count - 1);

-                        continue;

-                    }

-

-                    //collect words from the new pivot

-                    CollectWordsFromPivot(board, validNextSubstringsAdjTile, currentSubstring);

-

-                    //once used, remove the alphabet from the string and mark the tile as not visited. This is because this tile maybe involved in paths from other tiles.

-                    currentSubstring.RemoveAt(currentSubstring.Count - 1);

-                    adjacentTile.IsVisited = false;

-                }

-            }

-        }

-    }

-}

@@ -1,13 +0,0 @@

-namespace Boggle

-{

-    static class Constants

-    {

-        public const string CURATED_FILE_SUFFIX = "curated";

-        public const int MIN_SIDE_LENGTH = 3;

-        public const int MIN_WORD_LENGTH = 3;

-        public const int MIN_SCORE = 1;

-        public const string TWS_FILE_PATH = @"wordlists/TWL06.txt";

-        public const string ZINGARELLI_FILE_PATH = @"wordlists/zingarelli2005.txt";

-

-    }

-}

@@ -1,29 +0,0 @@

-using System.Collections.Generic;

-

-namespace Boggle

-{

-    public class ListWord

-    {

-        public bool IsWord;

-        public Dictionary<string, ListWord> Next;

-

-        public ListWord()

-        {

-            this.IsWord = false;

-            this.Next = null;

-        }

-

-        public ListWord(bool isWord)

-        {

-            this.IsWord = isWord;

-            this.Next = null;

-        }

-

-        public ListWord(bool isWord, Dictionary<string, ListWord> next)

-        {

-            this.IsWord = isWord;

-            this.Next = next;

-        }

-

-    }

-}

@@ -1,70 +0,0 @@

-namespace Boggle

-{

-    public class Tile

-    {

-        //declaring readonly as these values will never be modified once set and compiler has ways to optimize for this.

-        private readonly int _X;

-        /// <summary>

-        /// X co-ordinate of the tile in the board array.

-        /// This is a read only property.

-        /// </summary>

-        public int X

-        {

-            get

-            {

-                return _X;

-            }

-        }

-

-        /// <summary>

-        /// Y co-ordinate of the tile in the board array.

-        /// This is a read only property.

-        /// </summar

-        private readonly int _Y;

-        public int Y

-        {

-            get

-            {

-                return _Y;

-            }

-        }

-

-        /// <summary>

-        /// The alphabet contained in the tile. It can be any valid letter or 'QU'.

-        /// This is a read only property.

-        /// </summary>

-        private readonly string _Alphabet;

-        public string Alphabet

-        {

-            get

-            {

-                return _Alphabet;

-            }

-        }

-

-        /// <summary>

-        /// Tells whether this tile has been visited or not during recursion.

-        /// </summary>

-        public bool IsVisited { get; set; }

-

-        public Tile(int x, int y, string alphabet)

-        {

-            _X = x;

-            _Y = y;

-            _Alphabet = alphabet;

-            IsVisited = false;

-        }

-

-        /// <summary>

-        /// Copy constructor to use when using threads.

-        /// </summary>

-        /// <param name="t"></param>

-        public Tile(Tile t)

-        {

-            _X = t._X;

-            _Y = t._Y;

-            _Alphabet = t._Alphabet;

-            IsVisited = t.IsVisited;

-        }

-    }

-}

@@ -1,28 +0,0 @@

-using System.Collections.Generic;

-

-namespace Boggle

-{

-    /// <summary>

-    /// Equality comparer used for HashSet. No longer used as I switched to Dictionaries.

-    /// </summary>

-    public class WordComparer : EqualityComparer<WordOnBoard>

-    {

-        public override bool Equals(WordOnBoard x, WordOnBoard y)

-        {

-            return string.Compare(x.Word, y.Word, true) == 0;

-        }

-

-        public override int GetHashCode(WordOnBoard obj)

-        {

-            int hash = 0;

-            for (int i = 0; i < obj.Word.Length; i++)

-            {

-                hash += (int)obj.Word[i] * 10 ^ (obj.Word.Length - 1 - i);

-

-                //cat would result in 99 * 10^2 + 97 * 10^1 + 116 * 10^0 = 10986

-            }

-

-            return hash;

-        }

-    }

-}

@@ -1,15 +0,0 @@

-

-namespace Boggle

-{

-    public struct WordOnBoard

-    {

-        public string Word;

-        public int Score;

-

-        public WordOnBoard(string word, int score)

-        {

-            this.Word = word;

-            this.Score = score;

-        }

-    }

-}