Demonstration of N Queen Problem CG OpenGL Project Report
The Report (Both Word and PDF format) is Downloadable immediately after the successful payment
This project deals with the demonstration of the ‘N-Queen problem’. In this project, a solution is proposed for the N-Queen problem. An N-queen problem is basically a generalized form of the 4-Queen problem. In the 4-Queen problem, the goal is to place 4 Queens such that no queen can kill the other using standard chess queen moves. Development of OpenGL program which shows the 3D demonstration of N-Queen problem mapping to solid objects transformations is one of the important applications in computer graphics. It means Rotation, Scaling, and Transformation of 3-Dimensional objects, like spheres, torus, cones, cubes and octahedrons. It also includes a change of Queen color and rotation, including the 3 ways, like of x-axis, y-axis, and z-axis. The above operation can be done using mouse and keyboard interface. The animation which makes the application more interesting, with the arrow keys, move the Queens front and back, number keys move the camera. Mouse buttons control the changing of colors, queen size, theme, reset of camera and queens including exit option.
Project Report Contents
|2.3||Execution in MS Visual studio||4|
|3.2||Flowchart of the system||7|
There are no reviews yet.