8-QUEEN CHESS PUZZLE’S SOLUTION IMPLEMENTING BACKTRACKING ALGORITHM
8-QUEEN CHESS PUZZLE’S SOLUTION
IMPLEMENTING BACKTRACKING
ALGORITHM
I. INTRODUCTION Did you ever think that you can play chess with an eight queen in it? A simple board game, that turned into a tricky game.
The Queen is the most powerful piece in the game of chess, but just how many queens can you fit on a chessboard before they start attacking each other? The answer is eight (8), but positioning so many of these influential ladies on a single board is a tricky challenge. Put them in the wrong place relative to each other and they’ll start to think that the board game isn’t big enough for them all, and that it will be it. All out war and tiaras at dawn.
Chess is one of the board game everyone is familiar with. One of the reasons why Chess had become one of the oldest and most popular board games mankind had ever played is because of the complexity of the game and simplicity of its objective.
The game is played by two players competing for the game’s objective. Each player has a set of Chess pieces consisting of 8 pawns, 2 rookies, 2 knights, 2 bishops, a king and a queen with each piece moves in a unique pattern.
To checkmate an opponent’s King, one must have a strategy on how to move each piece on a set. The uniqueness of each set is determined by its hierarchical position – pawn being the lowest and King as the most precious piece in a set. But the most powerful piece in the set is the Queen.
Chang (2003) stated that the eight queen problem refers to a configuration which cannot occur in an actual game, but which is based on properties of the queen. The problem is: place eight (8) queens on the board in such a way that no queen is attacking any other.
II. BACKGROUND OF THE PROJECT
The 8-Queen Chess puzzle which was originally proposed in 1848 by the chess player Max Bezzel is a problem of placing eight (8) chess Queens on an 8x8 chessboard so that no two queens attack each other.
The problem that is defined by Kumar (2008) stated that the
IMPLEMENTING BACKTRACKING
ALGORITHM
I. INTRODUCTION Did you ever think that you can play chess with an eight queen in it? A simple board game, that turned into a tricky game.
The Queen is the most powerful piece in the game of chess, but just how many queens can you fit on a chessboard before they start attacking each other? The answer is eight (8), but positioning so many of these influential ladies on a single board is a tricky challenge. Put them in the wrong place relative to each other and they’ll start to think that the board game isn’t big enough for them all, and that it will be it. All out war and tiaras at dawn.
Chess is one of the board game everyone is familiar with. One of the reasons why Chess had become one of the oldest and most popular board games mankind had ever played is because of the complexity of the game and simplicity of its objective.
The game is played by two players competing for the game’s objective. Each player has a set of Chess pieces consisting of 8 pawns, 2 rookies, 2 knights, 2 bishops, a king and a queen with each piece moves in a unique pattern.
To checkmate an opponent’s King, one must have a strategy on how to move each piece on a set. The uniqueness of each set is determined by its hierarchical position – pawn being the lowest and King as the most precious piece in a set. But the most powerful piece in the set is the Queen.
Chang (2003) stated that the eight queen problem refers to a configuration which cannot occur in an actual game, but which is based on properties of the queen. The problem is: place eight (8) queens on the board in such a way that no queen is attacking any other.
II. BACKGROUND OF THE PROJECT
The 8-Queen Chess puzzle which was originally proposed in 1848 by the chess player Max Bezzel is a problem of placing eight (8) chess Queens on an 8x8 chessboard so that no two queens attack each other.
The problem that is defined by Kumar (2008) stated that the
Bibliography: Chang, S.K., Data Structures and Algorithm. World Scientific Publishing Co.Pte. Ltd. (2003) Eiben A Kumar, E. Artificial Intelligence. International Publishing House Pvt. Ltd., New Delhi, India (2008). Muniswamy V.V. Design and Analysis of Algorithms. I.K. International Pvt. Ltd (2009) Nilsson N.J Skiena S. S. The Algorithm Design Manual. Springer – Verlag, London (2008) Wilkinson, S Wilson, F. 101 Questions on How to Play Chess. Dover Publications, Inc. Don Mills, Toronto, Ontario, Canada. (1994).