Artificial Intelligence Programming Assignment :: Essays Papers

Artificial Intelligence Programming Assignment puzzle StatementsEight-Queens astoundIs it possible to place eight Queens on a chessboard, so that n maven of the Queens occupy the same row, column, or apoplexy? binary star SearchDepth-First & Breadth-First SearchNewtons Method develop a snatch whose self-colored root is to be calculated, any ordained add up.Take a view at the numbers square up root.Calculate the square root by improving on the genuine shot as indicatedNext guess = (number/ occurrent guess + current guess)/ 2Repeat this dish up until the difference between the next guess and the current is within the accepted level of accuracy. The better your guess, the fewer the number of iterations needed to get the square root. A good first guess is typically half the number whose square root is to be calculated. The process is ten repeated until the desired accuracy is achieved.Newton-Raphson MethodDetermine a root of the equation f(x) = x3-x2-9x+9 = 0 using the Newt on-Raphson method if the initial guess is x1 = 1.5.Gauss-Siedel Method Solve the following set of bilinear simultaneous equations using the Gauss-Seidel method10x1 + 2x2 + 3x3 = 11 X1 + 5x2 + 2x3 = 20 3x1 + 2x2 + 6x3 = -12Theoretical SolutionsEight-Queens Puzzle1.Pick a position for the Queen2.If legal, go to next row.3.If illegal, gazump the next position.4.If no legal position is found, back up to one row.If legal positions are found for all eight rows, the problem is solved.Binary SearchSearch the current knob value to see if it equals the front value.If the search value is smaller than the current value, make the current thickener the left churl node.Make the current node the right child node.Depth-First & Breadth-First SearchDepth-First Search Searches as far down the left side of meat of the binary tree.When it encounters, NULL, the search switches to the bottom-most right child and resumes.Breadth-First Search Remove a node from the queue. This becom es the current node.Place all child nodes of the current node onto the queue.Newtons MethodGet a positive number whose square root is to be calculated from the user.Get the desired precision. dapple more numbers remain, calculate firs guess, x0.RepeatXn = 0.5 * (X (n-1) + Number/ X (n-1))Until abs (Xn - X (n 1)) *= Desired precisionGet a positive number whose square root is to be calculated from the user.Get the desired precision.End whileNewton-Raphson Method1.Set number of iterations num_iter to zero.