トップページに戻る    次のC#のサンプルへ    前のC#のサンプルへ

20-097 森のどうぶつパズル

問題

小田原充宏さんの森のどうぶつパズルを解きます。




7つのピースは下記となります。
各ピースは回転や裏返しても使えます。

兎
兎
兎
兎

馬
馬馬馬馬

亀
亀亀

羊羊羊
羊羊

豚豚
豚豚

 河
河河河河

  栗
栗栗栗


ソース

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    const int UB_X = 6 - 1;
    const int UB_Y = 5 - 1;

    static char[] AnimalArr = { '兎', '馬', '亀', '羊', '豚', '河', '栗' };

    //動物ごとの配置候補
    static Dictionary<char, List<bool[,]>> HaitiKouhoListDict =
        new Dictionary<char, List<bool[,]>>();

    struct JyoutaiDef
    {
        internal char[,] BanArr;
        internal int CurrX;
        internal int CurrY;
    }

    static void Main()
    {
        var sw = System.Diagnostics.Stopwatch.StartNew();

        foreach (char EachAnimal in AnimalArr) {
            HaitiKouhoListDict[EachAnimal] = DeriveHaitiKouhoList(EachAnimal);
        }

        //問23
        char[,] Q023 = {{'兎','兎','兎','兎','羊','羊'},
                        {'豚','豚','馬','羊','羊','羊'},
                        {'豚','豚','馬','馬','馬','馬'},
                        {'□','□','□','□','□','□'},
                        {'□','□','□','□','□','□'}};

        //問25
        char[,] Q025 = {{'栗','馬','馬','馬','馬','□'},
                        {'栗','馬','羊','羊','□','□'},
                        {'栗','栗','羊','羊','□','□'},
                        {'豚','豚','羊','□','□','□'},
                        {'豚','豚','□','□','□','□'}};

        //問題29
        char[,] Q029 = {{'河','河','河','河','□','□'},
                        {'兎','河','羊','羊','□','□'},
                        {'兎','羊','羊','羊','□','□'},
                        {'兎','豚','豚','□','□','□'},
                        {'兎','豚','豚','□','□','□'}};

        //問題30
        char[,] Q030 = {{'馬','馬','馬','馬','□','□'},
                        {'馬','亀','兎','□','□','□'},
                        {'亀','亀','兎','□','□','□'},
                        {'豚','豚','兎','□','□','□'},
                        {'豚','豚','兎','□','□','□'}};

        //問題101
        char[,] Q101 = {{'□','□','□','□','□','□'},
                        {'羊','羊','羊','□','□','□'},
                        {'□','羊','羊','□','□','□'},
                        {'□','□','□','□','□','□'},
                        {'□','□','□','□','□','□'}};

        //char[,] wkBan = Q023;
        //char[,] wkBan = Q025;
        //char[,] wkBan = Q029;
        //char[,] wkBan = Q030;
        char[,] wkBan = Q101;

        //X座標とY座標の入れ替え
        char[,] XYRevBan = new char[UB_X + 1, UB_Y + 1];
        for (int X = 0; X <= UB_X; X++) {
            for (int Y = 0; Y <= UB_Y; Y++) {
                XYRevBan[X, Y] = wkBan[Y, X];
            }
        }

        var stk = new Stack<JyoutaiDef>();
        JyoutaiDef WillPush;
        WillPush.BanArr = XYRevBan;
        WillPush.CurrX = WillPush.CurrY = 0;
        stk.Push(WillPush);

        int AnwserCnt = 0;
        while (stk.Count > 0) {
            JyoutaiDef Popped = stk.Pop();

            //クリア判定
            if (Popped.BanArr.Cast<char>().All(X => X != '□')) {
                Console.WriteLine("解{0}を発見。経過時間={1}", ++AnwserCnt, sw.Elapsed);
                PrintAnswer(Popped.BanArr);
                continue;
            }

            //X座標の繰上げ処理
            if (Popped.CurrX > UB_X) {
                Popped.CurrX = 0;
                Popped.CurrY++;
            }

            //最終行を超えた場合
            if (Popped.CurrY > UB_Y) continue;

            //使用済の動物の列挙インターフェース
            IEnumerable<char> UsedAnimalEnum = Popped.BanArr.Cast<char>().Distinct();

            foreach (char EachAnimal in AnimalArr.Except(UsedAnimalEnum)) {
                //動物の配置候補リスト
                List<bool[,]> HaitiKouhoList = new List<bool[,]>();
                HaitiKouhoList.AddRange(HaitiKouhoListDict[EachAnimal]);

                //現在のマス目が空白の場合は、マス目を埋める必要あり
                if (Popped.BanArr[Popped.CurrX, Popped.CurrY] == '□') {
                    HaitiKouhoList.RemoveAll(X => X[0, 0] == false);
                }

                //マス目に動物を埋めれない候補をRemove
                HaitiKouhoList.RemoveAll(X =>
                    CanFillPiece(X, Popped.CurrX, Popped.CurrY, Popped.BanArr) == false);

                //ピースを配置する経路のPush処理
                foreach (bool[,] AnyPieceMap in HaitiKouhoList) {
                    WillPush.BanArr = (char[,])Popped.BanArr.Clone();
                    WillPush.CurrX = Popped.CurrX + 1;
                    WillPush.CurrY = Popped.CurrY;

                    for (int X = 0; X <= AnyPieceMap.GetUpperBound(0); X++) {
                        for (int Y = 0; Y <= AnyPieceMap.GetUpperBound(1); Y++) {
                            if (AnyPieceMap[X, Y] == false) continue;
                            WillPush.BanArr[Popped.CurrX + X, Popped.CurrY + Y] = EachAnimal;
                        }
                    }
                    stk.Push(WillPush);
                }
            }

            //現在のマス目が空白でない場合は、ピースを配置しない経路のPush
            if (Popped.BanArr[Popped.CurrX, Popped.CurrY] != '□') {
                WillPush.BanArr = Popped.BanArr;
                WillPush.CurrX = Popped.CurrX + 1;
                WillPush.CurrY = Popped.CurrY;
                stk.Push(WillPush);
            }
        }
    }

    //動物名を引数として、回転させた配置のListを返す
    static List<bool[,]> DeriveHaitiKouhoList(char pAnimalName)
    {
        bool[,] wkArr = null;

        if (pAnimalName == '兎') {
            wkArr = new bool[1, 4];
            wkArr[0, 0] = true;
            wkArr[0, 1] = true;
            wkArr[0, 2] = true;
            wkArr[0, 3] = true;
        }
        if (pAnimalName == '馬') {
            wkArr = new bool[4, 2];
            wkArr[0, 0] = true; wkArr[1, 0] = wkArr[2, 0] = wkArr[3, 0] = false;
            wkArr[0, 1] = wkArr[1, 1] = wkArr[2, 1] = wkArr[3, 1] = true;
        }
        if (pAnimalName == '亀') {
            wkArr = new bool[2, 2];
            wkArr[0, 0] = true; wkArr[1, 0] = false;
            wkArr[0, 1] = wkArr[1, 1] = true;
        }
        if (pAnimalName == '羊') {
            wkArr = new bool[3, 2];
            wkArr[0, 0] = wkArr[1, 0] = wkArr[2, 0] = true;
            wkArr[0, 1] = wkArr[1, 1] = true; wkArr[2, 1] = false;
        }
        if (pAnimalName == '豚') {
            wkArr = new bool[2, 2];
            wkArr[0, 0] = wkArr[1, 0] = true;
            wkArr[0, 1] = wkArr[1, 1] = true;
        }
        if (pAnimalName == '河') {
            wkArr = new bool[4, 2];
            wkArr[0, 0] = false; wkArr[1, 0] = true; ; wkArr[2, 0] = wkArr[3, 0] = false;
            wkArr[0, 1] = wkArr[1, 1] = wkArr[2, 1] = wkArr[3, 1] = true;
        }
        if (pAnimalName == '栗') {
            wkArr = new bool[3, 2];
            wkArr[0, 0] = wkArr[1, 0] = false; wkArr[2, 0] = true;
            wkArr[0, 1] = wkArr[1, 1] = wkArr[2, 1] = true;
        }

        return DeriveKaitenArrList(wkArr);
    }

    //配列を引数として、回転させた配列のリストをDistinctして返す
    static List<bool[,]> DeriveKaitenArrList(bool[,] pBaseArr)
    {
        var KaitenArrList = new List<bool[,]>();

        //1個目はそのまま
        //■
        //■■■

        //2個目は1個目を時計回りに90度回転
        //■■
        //■
        //■

        //3個目は2個目を時計回りに90度回転
        //■■■
        //  ■

        //4個目は3個目を時計回りに90度回転
        // ■
        // ■
        //■■

        //5個目は1個目とX軸で線対称
        //■■■
        //■

        //6個目は5個目を時計回りに90度回転
        //■■
        // ■
        // ■

        //7個目は6個目を時計回りに90度回転
        //  ■
        //■■■

        //8個目は7個目を時計回りに90度回転
        //■
        //■
        //■■

        int BaseArrUB_X = pBaseArr.GetUpperBound(0);
        int BaseArrUB_Y = pBaseArr.GetUpperBound(1);

        for (int I = 1; I <= 8; I++) KaitenArrList.Add(null);
        for (int P = 0; P <= 6; P += 2) KaitenArrList[P] = new bool[BaseArrUB_X + 1, BaseArrUB_Y + 1];
        for (int P = 1; P <= 7; P += 2) KaitenArrList[P] = new bool[BaseArrUB_Y + 1, BaseArrUB_X + 1];

        for (int X = 0; X <= BaseArrUB_X; X++) {
            for (int Y = 0; Y <= BaseArrUB_Y; Y++) {
                bool SetVal = pBaseArr[X, Y];
                KaitenArrList[0][X, Y] = SetVal;
                KaitenArrList[1][Y, BaseArrUB_X - X] = SetVal;
                KaitenArrList[2][BaseArrUB_X - X, BaseArrUB_Y - Y] = SetVal;
                KaitenArrList[3][BaseArrUB_Y - Y, X] = SetVal;

                KaitenArrList[4][X, BaseArrUB_Y - Y] = SetVal;
                KaitenArrList[5][BaseArrUB_Y - Y, BaseArrUB_X - X] = SetVal;
                KaitenArrList[6][BaseArrUB_X - X, Y] = SetVal;
                KaitenArrList[7][Y, X] = SetVal;
            }
        }

        //Distinctする
        for (int I = KaitenArrList.Count - 1; 0 <= I; I--) {
            for (int J = 0; J <= I - 1; J++) {
                if (KaitenArrList[I].GetUpperBound(0) !=
                    KaitenArrList[J].GetUpperBound(0)) continue;
                if (KaitenArrList[I].GetUpperBound(1) !=
                    KaitenArrList[J].GetUpperBound(1)) continue;

                IEnumerable<bool> wkEnum1 = KaitenArrList[I].Cast<bool>();
                IEnumerable<bool> wkEnum2 = KaitenArrList[J].Cast<bool>();
                if (wkEnum1.SequenceEqual(wkEnum2) == false) continue;

                KaitenArrList.RemoveAt(I);
                break;
            }
        }
        return KaitenArrList;
    }

    //マス目にピースを埋めれるか
    static bool CanFillPiece(bool[,] pPieceMap, int pTargetX, int pTargetY, char[,] pBanArr)
    {
        if (pTargetX + pPieceMap.GetUpperBound(0) > UB_X) return false;
        if (pTargetY + pPieceMap.GetUpperBound(1) > UB_Y) return false;

        for (int X = 0; X <= pPieceMap.GetUpperBound(0); X++) {
            for (int Y = 0; Y <= pPieceMap.GetUpperBound(1); Y++) {
                if (pPieceMap[X, Y] && pBanArr[pTargetX + X, pTargetY + Y] != '□')
                    return false;
            }
        }
        return true;
    }

    //解を出力
    static void PrintAnswer(char[,] pBanArr)
    {
        var sb = new System.Text.StringBuilder();
        for (int Y = 0; Y <= UB_Y; Y++) {
            for (int X = 0; X <= UB_X; X++) {
                sb.Append(pBanArr[X, Y]);
            }
            sb.AppendLine();
        }
        Console.WriteLine(sb.ToString());
    }
}


実行結果

解1を発見。経過時間=00:00:00.0987499
馬馬馬馬豚豚
羊羊羊馬豚豚
栗羊羊河亀亀
栗河河河河亀
栗栗兎兎兎兎


解説

20-096 どうぶつ図形パズルと、ほとんど同じソースを使ってます。