Deitel & Deitel, C How to Program 6th Edition, Exercise 6.26 (Eight Queens)

/*6.26 (Eight Queens) Another puzzler for chess buffs is the Eight Queens problem. Simply stated:
Is it possible to place eight queens on an empty chessboard so that no queen is “attacking” any other—
that is, so that no two queens are in the same row, the same column, or along the same diagonal?
Use the kind of thinking developed in Exercise 6.24 to formulate a heuristic for solving the Eight
Queens problem. Run your program. [Hint: It’s possible to assign a numeric value to each square
of the chessboard indicating how many squares of an empty chessboard are “eliminated” once a
queen is placed in that square. For example, each of the four corners would be assigned the value
22, as in Fig. 6.26.]
Once these “elimination numbers” are placed in all 64 squares, an appropriate heuristic might
be: Place the next queen in the square with the smallest elimination number. Why is this strategy
intuitively appealing?*/

#include <stdio.h>


ones(int, int, int boart[8][8]);
rates(int boar[8][8]);
decide(int brd[8][8]);
print(int a[8][8]);


int main() {

int board[8][8] = { 0 };

rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);

smallestRate(board);
rates(board);
print(board);
return 0;
}

print(int a[8][8]) {
int i, j;
for (i = 0; i < 8; i++) {
for (j = 0; j < 8; j++)
printf("%3d", a[i][j]);
printf("\n");
}
printf("\n");
}

smallestRate(int bo[8][8]) {
int a, b, i, j, smallest = 99;
for (a = 0; a < 8; a++)
for (b = 0; b < 8; b++) {
if (bo[a][b] < smallest && bo[a][b] != -1) {
smallest = bo[a][b];
i = a;
j = b;
}
}
ones(i, j, bo);

}

decide(int brd[8][8]) {
int i, j, sum, a, b, max = 0, bestRow, bestColumn;
for (i = 0; i < 8; i++) {
for (j = 0; j < 8; j++) {
if (brd[i][j] != -1) {
sum = brd[i][j];
a = i + 1;
b = j;
while (a < 8) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a++;
}
a = i - 1;
b = j;
while (a > -1) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a--;
}
a = i;
b = j + 1;
while (b < 8) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
b++;
}
a = i;
b = j - 1;
while (b > -1) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
b--;
}
//çaprazlar
a = i + 1;
b = j + 1;
while (a < 8 && b < 8) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a++;
b++;
}
a = i - 1;
b = j + 1;
while (a > -1 && b < 8) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a--;
b++;
}
a = i + 1;
b = j - 1;
while (a < 8 && b > -1) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a++;
b--;
}
a = i - 1;
b = j - 1;
while (a > -1 && b > -1) {
brd[a][b] != -1 ? sum += brd[a][b] : 0;
a--;
b--;
}
if (sum > max) {
max = sum;
bestRow = i;
bestColumn = j;
}
}
}
}
ones(bestRow, bestColumn, brd);

}

ones(int row, int column, int boart[8][8]) { // a and b are where you put your queen
int counter = 1, a, b;
boart[row][column] = -1;
a = row + 1;
b = column;

while (a < 8) {
boart[a][b] = -1;
a++;
}
a = row - 1;
b = column;
while (a > -1) {
boart[a][b] = -1;
a--;
}
a = row;
b = column + 1;
while (b < 8) {
boart[a][b] = -1;
b++;
}
a = row;
b = column - 1;
while (b > -1) {
boart[a][b] = -1;
b--;
}
//çaprazlar
a = row + 1;
b = column + 1;
while (a < 8 && b < 8) {
boart[a][b] = -1;
a++;
b++;
}
a = row - 1;
b = column + 1;
while (a > -1 && b < 8) {
boart[a][b] = -1;
a--;
b++;
}
a = row + 1;;
b = column - 1;
while (a < 8 && b > -1) {
boart[a][b] = -1;
a++;
b--;
}
a = row - 1;
b = column - 1;
while (a > -1 && b > -1) {
boart[a][b] = -1;
a--;
b--;
}
}
rates(int boar[8][8]) {
int i, j, counter = 1, a, b;
for (i = 0; i < 8; i++) {
for (j = 0; j < 8; j++) {
if (boar[i][j] != -1) {
a = i + 1;
b = j;
while (a < 8) {
boar[a][b] != -1 ? counter++ : 0;
a++;
}
a = i - 1;
b = j;
while (a > -1) {
boar[a][b] != -1 ? counter++ : 0;
a--;
}
a = i;
b = j + 1;
while (b < 8) {
boar[a][b] != -1 ? counter++ : 0;
b++;
}
a = i;
b = j - 1;
while (b > -1) {
boar[a][b] != -1 ? counter++ : 0;
b--;
}
//çaprazlar
a = i + 1;
b = j + 1;
while (a < 8 && b < 8) {
boar[a][b] != -1 ? counter++ : 0;
a++;
b++;
}
a = i - 1;
b = j + 1;
while (a > -1 && b < 8) {
boar[a][b] != -1 ? counter++ : 0;
a--;
b++;
}
a = i + 1;
b = j - 1;
while (a < 8 && b > -1) {
boar[a][b] != -1 ? counter++ : 0;
a++;
b--;
}
a = i - 1;
b = j - 1;
while (a > -1 && b > -1) {
boar[a][b] != -1 ? counter++ : 0;
a--;
b--;
}
boar[i][j] = counter;
counter = 1;
}
}
}
}


Let me know in the comments if this page helped you somehow.

It is nice to know if my work helped someone, thanks :)

Comments

Post a Comment

Popular posts from this blog

Deitel & Deitel, C How to Program 6th Edition, Exercise 6.23 (Turtle Graphics)

/*6.23 (Turtle Graphics) The Logo language, which is particularly popular among personal computer users, made the concept of turtle graphics famous. Imagine a mechanical turtle that walks around the room under the control of a C program. The turtle holds a pen in one of two positions, up or down. While the pen is down, the turtle traces out shapes as it moves; while the pen is up, the turtle moves about freely without writing anything. In this problem you’ll simulate the operation of the turtle and create a computerized sketchpad as well. Use a 50-by-50 array floor which is initialized to zeros. Read commands from an array that contains them. Keep track of the current position of the turtle at all times and whether the pen is currently up or down. Assume that the turtle always starts at position 0, 0 of the floor with its pen up. The set of turtle commands your program must process are shown in Fig. 6.24. Suppose that the turtle is somewhere near the center of the floor. The ...
Read more

Deitel & Deitel, C How to Program 6th Edition, Exercise 6.22 (Total Sales)

/*6.22 (Total Sales) Use a double-subscripted array to solve the following problem. A company has four salespeople (1 to 4) who sell five different products (1 to 5). Once a day, each salesperson passes in a slip for each different type of product sold. Each slip contains: a) The salesperson number b) The product number c) The total dollar value of that product sold that day Thus, each salesperson passes in between 0 and 5 sales slips per day. Assume that the information from all of the slips for last month is available. Write a program that will read all this information for last month’s sales and summarize the total sales by salesperson by product. All totals should be stored in the double-subscripted array sales. After processing all the information for last month, print the results in tabular format with each of the columns representing a particular salesperson and each of the rows representing a particular product. Cross total each row to get the total sales of each pr...
Read more

Deitel & Deitel, C How to Program 6th Edition, Exercise 5.47 (Craps Game Modification)

/*5.47 (Craps Game Modification) Modify the craps program of Fig. 5.10 to allow wagering. Package as a function the portion of the program that runs one game of craps. Initialize variable bankBalance to 1000 dollars. Prompt the player to enter a wager. Use a while loop to check that wager is less than or equal to bankBalance, and if not, prompt the user to reenter wager until a valid wager is entered. After a correct wager is entered, run one game of craps. If the player wins, increase bankBalance by wager and print the new bankBalance. If the player loses, decrease bankBalance by wager, print the new bankBalance, check if bankBalance has become zero, and if so print the message, "Sorry. You busted!" As the game progresses, print various messages to create some “chatter” such as, "Oh, you're going for broke, huh?" or "Aw cmon, take a chance!" or "You're up big. Now's the time to cash in your chips!"*/ #include <stdio.h...
Read more