Example #1
0
        private void solveViaFlippedNumbers()
        {
            bool change;

            do
            {
                change = false;
                for (LinkedListNode <int> k = flippedNumbers.First; k != null; k = k.Next)
                {
                    int count        = 0;
                    int countFlagged = 0;
                    int countHiddenAdjacentFields = 0;
                    int x = (k.Value % fieldSize.Width);
                    int y = (int)Math.Floor(k.Value / (double)fieldSize.Width);

                    for (int adjacentX = ((0 <= x - 1) ? (x - 1) : x); adjacentX <= ((x + 1 < fieldSize.Width) ? (x + 1) : x); adjacentX++)
                    {
                        for (int adjacentY = ((0 <= y - 1) ? (y - 1) : y); adjacentY <= ((y + 1 < fieldSize.Height) ? (y + 1) : y); adjacentY++)
                        {
                            if (field[adjacentX + adjacentY * fieldSize.Width].isMine)
                            {
                                if (field[adjacentX + adjacentY * fieldSize.Width].state != Space.STATE_FLAGGED)
                                {
                                    count++;
                                }
                                else
                                {
                                    countFlagged++;
                                }
                            }
                            if (field[adjacentX + adjacentY * fieldSize.Width].state == Space.STATE_HIDDEN)
                            {
                                countHiddenAdjacentFields++;
                            }
                        }
                    }


                    if (count == countHiddenAdjacentFields && 0 < count)
                    {
                        for (int adjacentX = ((0 <= x - 1) ? (x - 1) : x); adjacentX <= ((x + 1 < fieldSize.Width) ? (x + 1) : x); adjacentX++)
                        {
                            for (int adjacentY = ((0 <= y - 1) ? (y - 1) : y); adjacentY <= ((y + 1 < fieldSize.Height) ? (y + 1) : y); adjacentY++)
                            {
                                if (field[adjacentX + adjacentY * fieldSize.Width].state == Space.STATE_HIDDEN)
                                {
                                    field[adjacentX + adjacentY * fieldSize.Width].state = Space.STATE_FLAGGED;
                                }
                            }
                        }
                        change = true;
                        flippedNumbers.Remove(k);
                    }
                    else if (countFlagged == field[k.Value].number)
                    {
                        for (int adjacentX = ((0 <= x - 1) ? (x - 1) : x); adjacentX <= ((x + 1 < fieldSize.Width) ? (x + 1) : x); adjacentX++)
                        {
                            for (int adjacentY = ((0 <= y - 1) ? (y - 1) : y); adjacentY <= ((y + 1 < fieldSize.Height) ? (y + 1) : y); adjacentY++)
                            {
                                if (field[adjacentX + adjacentY * fieldSize.Width].state == Space.STATE_HIDDEN)
                                {
                                    flipField(adjacentX + adjacentY * fieldSize.Width);
                                    if (minefield != null)
                                    {
                                        minefield.MainThreadInvoke(() =>
                                        {
                                            minefield.highlightedField = adjacentX + adjacentY * fieldSize.Width;
                                            minefield.disabled         = false;
                                            minefield.disabled         = true;
                                        });
                                        System.Threading.Thread.Sleep(10);
                                    }
                                }
                            }
                        }
                        change = true;
                        flippedNumbers.Remove(k);
                    }
                }
            } while (change == true);
        }