Question

mips code for n queen problem

Answer 1

class queen position

{

int row;

int col;

int n

public queen position(int row, int col) {

super( );

this.row = row;

this.col = col;

this.n = n;

}

import java.io.PrintWriter;

import java.util.Arrays;

import java.util.Scanner;

public class NQueenProblem {

    public static PrintWriter out = new PrintWriter(System.out);

    public static QueenPosition[] p;

    public static void main(String[] args) {

        System.out.println("Enter Number of Queens");

        Scanner s = new Scanner(System.in);

        int n = s.nextInt();

        p = new QueenPosition[n];

        if(getSolution(n,0))

        {

            int[][] result = new int[n][n];

            Arrays.stream(p).forEach(po->result[po.row][po.col]=1);

            out.println("Display using Stream API \n-----------------------");

            Arrays.stream(result)

            .forEach(rw -> {

                Arrays.stream(rw)

                .forEach(rw1-> out.print(rw1 + " "));

                out.println();

            });

             

            out.println("\n\nDisplay using normal For loop \n---------------------------");

            for(int i=0;i < n;i++)

            {

                for(int j=0;j < n;j++)

                {

                    out.print(result[i][j] + " ");

                }

            out.println();

            }

        }

        else

        {

            out.println("Solution not available.");

}

        out.flush();

    }

    public static boolean getSolution(int n, int row)

    {

    }  

}