tasks a-s
This commit is contained in:
Ingy döt Net
parent
47bf37c096
commit
b83f433714
12433 changed files with 156208 additions and 123 deletions
175
Task/N-queens-problem/PHP/n-queens-problem.php
Normal file
175
Task/N-queens-problem/PHP/n-queens-problem.php
Normal file
|
|
@ -0,0 +1,175 @@
|
|||
<html>
|
||||
<head>
|
||||
<title>
|
||||
n x n Queen solving program
|
||||
</title>
|
||||
</head>
|
||||
<body>
|
||||
<?php
|
||||
echo "<h1>n x n Queen solving program</h1>";
|
||||
|
||||
//Get the size of the board
|
||||
$boardX = $_POST['boardX'];
|
||||
$boardY = $_POST['boardX'];
|
||||
|
||||
// Function to rotate a board 90 degrees
|
||||
function rotateBoard($p, $boardX) {
|
||||
$a=0;
|
||||
while ($a < count($p)) {
|
||||
$b = strlen(decbin($p[$a]))-1;
|
||||
$tmp[$b] = 1 << ($boardX - $a - 1);
|
||||
++$a;
|
||||
}
|
||||
ksort($tmp);
|
||||
return $tmp;
|
||||
}
|
||||
|
||||
// This function will find rotations of a solution
|
||||
function findRotation($p, $boardX,$solutions){
|
||||
$tmp = rotateBoard($p,$boardX);
|
||||
// Rotated 90
|
||||
if (in_array($tmp,$solutions)) {}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
$tmp = rotateBoard($tmp,$boardX);
|
||||
// Rotated 180
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
$tmp = rotateBoard($tmp,$boardX);
|
||||
// Rotated 270
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
// Reflected
|
||||
$tmp = array_reverse($p);
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
$tmp = rotateBoard($tmp,$boardX);
|
||||
// Reflected and Rotated 90
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
$tmp = rotateBoard($tmp,$boardX);
|
||||
// Reflected and Rotated 180
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
|
||||
$tmp = rotateBoard($tmp,$boardX);
|
||||
// Reflected and Rotated 270
|
||||
if (in_array($tmp,$solutions)){}
|
||||
else {$solutions[] = $tmp;}
|
||||
return $solutions;
|
||||
}
|
||||
|
||||
// This is a function which will render the board
|
||||
function renderBoard($p,$boardX) {
|
||||
echo "<table border=1 cellspacing=0 style='text-align:center;display:inline'>";
|
||||
for ($y = 0; $y < $boardX; ++$y) {
|
||||
echo '<tr>';
|
||||
for ($x = 0; $x < $boardX; ++$x){
|
||||
if (($x+$y) & 1) { $cellCol = '#9C661F';}
|
||||
else {$cellCol = '#FCE6C9';}
|
||||
|
||||
if ($p[$y] == 1 << $x) { echo "<td bgcolor=".$cellCol."><img width=30 height=30 src='./images/blackqueen.png'></td>";}
|
||||
else { echo "<td bgcolor=".$cellCol."> </td>";}
|
||||
}
|
||||
echo '<tr>';
|
||||
}
|
||||
echo '<tr></tr></table> ';
|
||||
|
||||
}
|
||||
|
||||
//This function allows me to generate the next order of rows.
|
||||
function pc_next_permutation($p) {
|
||||
$size = count($p) - 1;
|
||||
// slide down the array looking for where we're smaller than the next guy
|
||||
|
||||
for ($i = $size - 1; $p[$i] >= $p[$i+1]; --$i) { }
|
||||
|
||||
// if this doesn't occur, we've finished our permutations
|
||||
// the array is reversed: (1, 2, 3, 4) => (4, 3, 2, 1)
|
||||
if ($i == -1) { return false; }
|
||||
|
||||
// slide down the array looking for a bigger number than what we found before
|
||||
for ($j = $size; $p[$j] <= $p[$i]; --$j) { }
|
||||
// swap them
|
||||
$tmp = $p[$i]; $p[$i] = $p[$j]; $p[$j] = $tmp;
|
||||
// now reverse the elements in between by swapping the ends
|
||||
for (++$i, $j = $size; $i < $j; ++$i, --$j)
|
||||
{ $tmp = $p[$i]; $p[$i] = $p[$j]; $p[$j] = $tmp; }
|
||||
return $p;
|
||||
}
|
||||
|
||||
//This function needs to check the current state to see if there are any
|
||||
function checkBoard($p,$boardX) {
|
||||
$a = 0; //this is the row being checked
|
||||
while ($a < count($p)) {
|
||||
$b = 1;
|
||||
while ($b < ($boardX - $a)){
|
||||
$x = $p[$a+$b] << $b;
|
||||
$y = $p[$a+$b] >> $b;
|
||||
if ($p[$a] == $x | $p[$a] == $y) { return false;}
|
||||
++$b;
|
||||
}
|
||||
++$a;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
if (isset($_POST['process']) && isset($_POST['boardX']))
|
||||
{
|
||||
//Within here is the code that needs to be run if process is clicked.
|
||||
|
||||
|
||||
//First I need to create the different possible rows
|
||||
for ($x = 0; $x < $boardX; ++$x){
|
||||
$row[$x] = 1 << $x;
|
||||
}
|
||||
|
||||
//Now I need to create all the possible orders of rows, will be equal to [boardY]!
|
||||
$solcount = 0;
|
||||
$solutions = array();
|
||||
while ($row != false) {
|
||||
if (checkBoard($row,$boardX)){
|
||||
if(!in_array($row,$solutions)){
|
||||
$solutions[] = $row;
|
||||
renderBoard($row,$boardX);
|
||||
$solutions = findRotation($row,$boardX,$solutions);
|
||||
++$solcount;
|
||||
}
|
||||
|
||||
}
|
||||
$row = pc_next_permutation($row);
|
||||
|
||||
}
|
||||
echo "<br><br>    Rows/Columns: ".$boardX."<br>    Unique Solutions: ".$solcount."<br>    Total Solutions: ".count($solutions)." - Note: This includes symmetrical solutions<br>";
|
||||
//print_r($solutions);
|
||||
}
|
||||
|
||||
//This code collects the starting parameters
|
||||
echo <<<_END
|
||||
<form name="input" action="queens.php" method="post">
|
||||
    Number of columns/rows <select name="boardX" />
|
||||
<option value="1">One</option>
|
||||
<option value="2">Two</option>
|
||||
<option value="3">Three</option>
|
||||
<option value="4" >Four</option>
|
||||
<option value="5">Five</option>
|
||||
<option value="6">Six</option>
|
||||
<option value="7">Seven</option>
|
||||
<option value="8" selected="selected">Eight</option>
|
||||
<option value="9">Nine</option>
|
||||
<option value="10">Ten</option>
|
||||
</select>
|
||||
<input type="hidden" name="process" value="yes" />
|
||||
 <input type="submit" value="Process" />
|
||||
</form>
|
||||
|
||||
_END;
|
||||
|
||||
?>
|
||||
</body>
|
||||
</html>
|
||||
Loading…
Add table
Add a link
Reference in a new issue