1 answer for 8 queens problem

最新推荐文章于 2021-02-19 22:17:36 发布

hzauzx2012

最新推荐文章于 2021-02-19 22:17:36 发布

阅读量182

点赞数 1

分类专栏： algorithm 文章标签： 8 queens

本文链接：https://blog.csdn.net/hzauzx2012/article/details/49469423

版权

algorithm 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

private bool Check(int row, int col)
{
//col check
for (int r = 0; r < row; r++)
{
if (Queens[r, col])
{
return false;
}
}
for (int r = row + 1; r < this.Size; r++)
{
if (Queens[r, col])
{
return false;
}
}

//row check
for (int c = 0; c < col; c++)
{
if (Queens[row, c])
{
return false;
}
}
for (int c = col + 1; c < this.Size; c++)
{
if (Queens[row, c])
{
return false;
}
}

//slash check
for (int r = 0; r < row; r++)
{
int c = row + col - r;
if (c >= 0 && c < this.Size)
{
if (Queens[r, c])
{
return false;
}
}
}
for (int r = row + 1; r < this.Size; r++)
{
int c = row + col - r;
if (c >= 0 && c < this.Size)
{
if (Queens[r, c])
{
return false;
}
}
}

//back slash check
for (int r = 0; r < row; r++)
{
int c = r - row + col;
if (c >= 0 && c < this.Size)
{
if (Queens[r, c])
{
return false;
}
}
}
for (int r = row + 1; r < this.Size; r++)
{
int c = r - row + col;
if (c >= 0 && c < this.Size)
{
if (Queens[r, c])
{
return false;
}
}
}

return true;

}

private int FindRowinCol(int col)
{
int row = 0;
for (; row < this.Size; row++)
{
if (Queens[row, col])
{
return row;
}
}

return NotExist;
}

private bool Find()
{
int row = 0;
int col = 0;
Queens[row, col] = true;
col++;
while (true)
{
for ( ; row < this.Size; row++)
{
if (this.Check(row, col))
{
Queens[row, col] = true;
break;
}
}

row = FindRowinCol(col);
if (row == NotExist)
{
do
{
col--;
if (col < 0)
{
return false;
}
row = FindRowinCol(col);
Queens[row, col] = false;
row++;
} while (row >= this.Size);
}
else
{
col++;
row = 0;
if (col >= this.Size)
{
break;
}
}
}
return true;
}