凑热闹-"一晚上的游戏"之WPF版

[zyntl]

源代码下载http://download.csdn.net/source/1881645
用MVVM模式写成的。
感觉难点在于搜索路径，这里是自己的算法，主要是加权了一下
int SearchPath(ObservableCollection<ButtonCommandViewModel> coll, int mouseIndex)
{
int resultIndex = -1;
double resultSteps = -1;
int leftIndex = -1, topIndex = -1, rightIndex = -1, bottomIndex = -1;
double leftSteps = -1, topSteps = -1, rightSteps = -1, bottomSteps = -1;
if (coll[mouseIndex - 1].ButtonState != IsShaded)//左
{
leftIndex = mouseIndex - 1;
leftSteps = coll[mouseIndex].IndexColumn;

int j = coll[mouseIndex].IndexColumn;
double weights = 1;//权值
for (int i = j - 1; i >= 0; i--)
{
int diff = j - i;
if (coll[mouseIndex - diff].ButtonState == IsShaded)
{
weights += 1.0 / diff;
}
}

//leftSteps *= weights;
for (int n = 0; n < Rows; n++)
leftSteps *= weights;
resultIndex = leftIndex;
resultSteps = leftSteps;
}
if (coll[mouseIndex - Columns].ButtonState != IsShaded)//上
{
topIndex = mouseIndex - Columns;
topSteps = coll[mouseIndex].IndexRow;

int j = coll[mouseIndex].IndexRow;
double weights = 1;//权值
for (int i = j - 1; i >= 0; i--)
{
int diff = j - i;
if (coll[mouseIndex - diff * Rows].ButtonState == IsShaded)
{
weights += 1.0 / (double)diff;
}
}
for (int n = 0; n < Rows; n++)
topSteps *= weights;

if (resultIndex < 0)
{
resultIndex = topIndex;
resultSteps = topSteps;
}
else
{
if (resultSteps > topSteps)
{
resultIndex = topIndex;
resultSteps = topSteps;
}
}
}
if (coll[mouseIndex + 1].ButtonState != IsShaded)//右
{
rightIndex = mouseIndex + 1;
rightSteps = Columns - 1 - coll[mouseIndex].IndexColumn;

int j = coll[mouseIndex].IndexColumn;
double weights = 1;//权值
for (int i = j + 1; i < Columns; i++)
{
int diff = i - j;
if (coll[mouseIndex + diff].ButtonState == IsShaded)
{
weights += 1.0 / (double)diff;
}
}
for (int n = 0; n < Rows; n++)
rightSteps *= weights;

if (resultIndex < 0)
{
resultIndex = rightIndex;
resultSteps = rightSteps;
}
else
{
if (resultSteps > rightSteps)
{
resultIndex = rightIndex;
resultSteps = rightSteps;
}
}
}
if (coll[mouseIndex + Columns].ButtonState != IsShaded)//下
{
bottomIndex = mouseIndex + Columns;
bottomSteps = Rows - 1 - coll[mouseIndex].IndexRow;

int j = coll[mouseIndex].IndexRow;
double weights = 1;//权值
for (int i = j + 1; i < Rows; i++)
{
int diff = i - j;
if (coll[mouseIndex + diff * Columns].ButtonState == IsShaded)
{
weights += 1.0 / (double)diff;
}
}
for (int n = 0; n < Rows; n++)
bottomSteps *= weights;

if (resultIndex < 0)
{
resultIndex = bottomIndex;
resultSteps = bottomSteps;
}
else
{
if (resultSteps > bottomSteps)
{
resultIndex = bottomIndex;
resultSteps = bottomSteps;
}
}
}
return resultIndex;

}

[abc1_2_3]

mark

[qiuqiuye]

看看

[liherun]

收藏

[mbh0210]

mark

[数据之巅]

都是牛人。。。

[长腿爸爸]

呵呵，昨天刚见识了Js版的，现在c#版又出来啦！

[biny101]

Up 学习

[biny237]

学习

[ddsxd19]

膜拜

[chengcheng1253]

[Quote=引用 17 楼 jaylianyu 的回复:]
呵呵，昨天刚见识了Js版的，现在c#版又出来啦！
[/Quote]
C#版？ 何以见得

[kkkkkkmn]

kankan

[zyntl]

搜索算法不够智能，谁能提供个好的算法不

[ljp0223]

强烈支持

[huangyic1986]

学习....Up

[十八道胡同]

支持

[wartim]

这个游戏最近很热门啊。。。期待出现F#版本的

[hhc123]

再怎么说也要顶一下
顺便给你点有用的东西
http://www.cnblogs.com/alamiye010

[whuzx]

强大~~~UP

[zyntl]

[Quote=引用 28 楼 hhc123 的回复:]
再怎么说也要顶一下
顺便给你点有用的东西
http://www.cnblogs.com/alamiye010
[/Quote]
呵呵，你的这些东西看过，很有想法

[hsq628]

强大。。必须要顶，我是来接分的，哈哈