九宫格移动算法实现

用.Net实现九宫格移动算法说明：在3*3的格子里，假设一个格子为空（在程序里是用0代表），其他格子可以移动到这个格子上，有多少种可能？答案是9的阶乘除以2=181440种，以下为程序实现，输出到d:\GridNine.txt文件中。

程序共两个类Program和Mygrid。

以下为代码：Program：--------------------------------------------------------------------------------------------using System;using System.Collections.Generic;using System.Windows.Forms;using System.IO;namespace WindowsApplication1{static class Program{static int gen = 0;///<summary>///应用程序的主入口点。

///</summary>[STAThread]static void Main(){//Application.EnableVisualStyles();//Application.SetCompatibleTextRenderingDefault(false);//Application.Run(new Form1());List<Mygrid> list = new List<Mygrid>();Mygrid iniGrid = new Mygrid('1', '2', '3', '4', '0', '5', '6', '7', '8');list.Add(iniGrid);iniGrid.Genaration = gen;gen = gen + 1;//以初始集合开始衍生ComputeAll(null,list);Console.WriteLine(list.Count);string[] output = new string[list.Count];for (int i = 0; i < list.Count; i++){Mygrid single = list[i];output[i] = single.GridToStringAll();}string context = string.Join(@"", output);using (StreamWriter savefile = new StreamWriter(@"d:\GridNine.txt")){savefile.WriteLine(context);savefile.Close();}MessageBox.Show(@"移动步骤保存成功！文件为：d:\GridNine.txt");}///<summary>//////</summary>///<param name="addList">新加入</param>///<param name="list">全部包含新加入</param>static void ComputeAll(List<Mygrid> addList,List<Mygrid> list){List<Mygrid> newList;if (addList == null){//计算当前list中变换得来的全部newList = GetAllNew(list);}else{newList = GetAllNew(addList);}//比较变换的是否存在于list中，更新list，如果list被更新，返回true，否则返回false//获得新放入的listList<Mygrid> resutl = IsUpdate(list, newList);//循环调用if (resutl.Count !=0){ComputeAll(resutl,list);}}static List<Mygrid> GetAllNew(List<Mygrid> list){//新建一个list，循环放变换之后的，去掉重复的List<Mygrid> newList = new List<Mygrid>();foreach (Mygrid grid in list){List<Mygrid> changeList = grid.Change(grid);addChangeList(newList, changeList);}return newList;}private static void addChangeList(List<Mygrid> newList, List<Mygrid> changeList) {foreach (Mygrid change in changeList){bool flag = false;List<Mygrid> tmp = new List<Mygrid>();foreach (Mygrid newSingel in newList){if (pareGrid(change)){flag = true;break;}}if (!flag){newList.Add(change);}}}private static List<Mygrid> IsUpdate(List<Mygrid> list, List<Mygrid> newList){List<Mygrid> result = new List<Mygrid>();foreach (Mygrid change in newList){bool flag = false;foreach (Mygrid oldSingle in list){if (pareGrid(change)){flag = true;break;}}if (!flag){result.Add(change);}}//统一放入foreach (Mygrid tmpSingel in result){tmpSingel.Genaration = gen;list.Add(tmpSingel);}gen = gen + 1;return result;}//合并两个集合，返回一个新的集合private static List<Mygrid> ComList(List<Mygrid> oldlist, List<Mygrid> newList){List<Mygrid> result = new List<Mygrid>();foreach (Mygrid tmp in oldlist){result.Add(tmp);}foreach (Mygrid tmp in newList){result.Add(tmp);}return result;}}}Mygrid：-------------------------------------------------------------------------------------------- using System;using System.Collections.Generic;using System.Text;namespace WindowsApplication1{class Mygrid{private char grid1;private char grid2;private char grid3;private char grid4;private char grid5;private char grid6;private char grid7;private char grid8;private char grid9;private int genaration;public int Genaration{get { return genaration; }set { genaration = value; }}public Mygrid(){grid1 = ' ';grid2 = ' ';grid3 = ' ';grid4 = ' ';grid5 = ' ';grid6 = ' ';grid7 = ' ';grid8 = ' ';grid9 = ' ';}public Mygrid(char grid1, char grid2, char grid3, char grid4, char grid5, char grid6, char grid7, char grid8, char grid9){this.grid1 = grid1;this.grid2 = grid2;this.grid3 = grid3;this.grid4 = grid4;this.grid5 = grid5;this.grid6 = grid6;this.grid7 = grid7;this.grid8 = grid8;this.grid9 = grid9;}//传入old获得新的public List<Mygrid> Change(Mygrid old){List<Mygrid> changeList = new List<Mygrid>();int zeroGrid=WhereZeroIs(old);switch (zeroGrid){case 1:changeList.Add(newMygrid(old.grid2,old.grid1,old.grid3,old.grid4,old.grid5,old.grid6,old.grid7,old.grid8,old.g rid9));changeList.Add(new Mygrid(old.grid4, old.grid2, old.grid3, old.grid1,old.grid5, old.grid6, old.grid7, old.grid8, old.grid9));return changeList;case 2:changeList.Add(new Mygrid(old.grid2, old.grid1, old.grid3, old.grid4,old.grid5, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid3, old.grid2, old.grid4,old.grid5, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid5, old.grid3, old.grid4,old.grid2, old.grid6, old.grid7, old.grid8, old.grid9));return changeList;case 3:changeList.Add(new Mygrid(old.grid1, old.grid3, old.grid2, old.grid4,old.grid5, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid6, old.grid4,old.grid5, old.grid3, old.grid7, old.grid8, old.grid9));return changeList;case 4:changeList.Add(new Mygrid(old.grid4, old.grid2, old.grid3, old.grid1,old.grid5, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid5,old.grid4, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid7,old.grid5, old.grid6, old.grid4, old.grid8, old.grid9));return changeList;case 5:changeList.Add(new Mygrid(old.grid1, old.grid5, old.grid3, old.grid4,old.grid2, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid5,old.grid4, old.grid6, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4,old.grid6, old.grid5, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4,old.grid8, old.grid6, old.grid7, old.grid5, old.grid9));return changeList;case 6:changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid6, old.grid4,old.grid5, old.grid3, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid6, old.grid5, old.grid7, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid9, old.grid7, old.grid8, old.grid6));return changeList;case 7:changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid7, old.grid5, old.grid6, old.grid4, old.grid8, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid6, old.grid8, old.grid7, old.grid9));return changeList;case 8:changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid8, old.grid6, old.grid7, old.grid5, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid6, old.grid8, old.grid7, old.grid9));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid6, old.grid7, old.grid9, old.grid8));return changeList;case 9:changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid9, old.grid7, old.grid8, old.grid6));changeList.Add(new Mygrid(old.grid1, old.grid2, old.grid3, old.grid4, old.grid5, old.grid6, old.grid7, old.grid9, old.grid8));return changeList;}return changeList;}public bool CompareGrid(Mygrid old){if (this.GridToString().Equals(old.GridToString())) return true;return false;}private int WhereZeroIs(Mygrid old){if (old.grid1 == '0') return 1;if (old.grid2 == '0') return 2;if (old.grid3 == '0') return 3;if (old.grid4 == '0') return 4;if (old.grid5 == '0') return 5;if (old.grid6 == '0') return 6;if (old.grid7 == '0') return 7;if (old.grid8 == '0') return 8;return 9;}string GridToString(){StringBuilder res = new StringBuilder();res.Append(grid1).Append(grid2).Append(grid3).Append(grid4).Append(grid5).Append(grid6).Appe nd(grid7).Append(grid8).Append(grid9);return res.ToString();}public string GridToStringAll(){StringBuilder res = new StringBuilder();res.Append(grid1).Append(grid2).Append(grid3).Append(grid4).Append(grid5).Append(grid6).Appe nd(grid7).Append(grid8).Append(grid9).Append(' ').Append(genaration.ToString ());return res.ToString();}}}。