2. Assuming a sequence of integer numbers, from X to Y (both received as input), where X

Make a 4x4 crossword puzzle for the picture below. Words that should be searchable are joy bob sun bow Letters that are searchable are f,k,s,s,b,j,o,u,b,o,b,n,x,y,w,y {'f', 'k', 's','s'} {'b', 'j', 'o','u'} {'b', 'o', 'b', 'n'} {'x', 'y', 'w', 'y'} Do not use the string library Call upon using the main function and all values will be stored in the class. There should be three menu options a search word, search letter and exit. Output word and letter if it exist and put not found it DNE. Use the given code as a template #include using namespace std; class Puzzle { private: char arr[4][4] public: // constructor Puzzle() { char arr[4][2] = {'f', 'k', 's','s'} {'b', 'j', 'o','u'} {'b', 'o', 'b', 'n'} {'x', 'y', 'w', 'y'} } ~Puzzle(){ } search(){ } void print_all() { for (int row = 0; row < n; row++) for (int column = 0; c…

There can only be one answer but this gives me two. Which one is the answer?

I need help with this code because I am struggling and I don't know what to do : question: you will develop a solver for the n-queens problem: n queens are to be placed on an n x n chessboard so that no pair of queens can attack each other. Recall that in chess, a queen can attack any piece that lies in the same row, column, or diagonal as itself. A brief treatment of this problem for the case where n = 8 is given below (from the 3rd edition of AIMA). N-queens is a useful test problem for search, with two main kinds of formulation. An incremental formulation involves operators that augment the state description, starting with an empty state; for the 8-queens problem, this means that each action adds a queen to the state. A complete-state formulation starts with all 8 queens on the board and moves them around. (In either case, the path cost is of no interest because only the final state counts.) The first incremental formulation one might try is the following, but (!) there are a very…