Register

NIELIT 2017 DEC Scientific Assistant A - Section B: 22

• retagged by
4,405 views

1 Answer

1 votes
1 votes

Backtracking algorithm is used to solve the 8 Queens problem.

8 Queens problem:

The eight queens problem is the problem of placing eight queens on an 8×8 chessboard such that none of them attack one another (no two are in the same row, column, or diagonal). More generally, the n queens problem places n queens on an n×n chessboard.

FOR MORE DETAILS:-

https://www.codesdope.com/blog/article/backtracking-explanation-and-n-queens-problem/

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
admin asked Mar 31, 2020
1,971 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 36
The average search time of hashing, with linear probing will be less if the load factor : is far less than $1$ equals $1$ is far greater than $1$ none of the options
The average search time of hashing, with linear probing will be less if the load factor :is far less than $1$equals $1$is far greater than $1$none of the options
User Avatar
6 votes
6 votes
5 answers
2
admin asked Mar 31, 2020
1,618 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 39
Merge sort uses : Divide-and-conquer Backtracking Heuristic approach Greedy approach
Merge sort uses :Divide-and-conquerBacktrackingHeuristic approachGreedy approach
User Avatar
5 votes
5 votes
5 answers
3
admin asked Mar 31, 2020
1,870 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
User Avatar
2 votes
2 votes
4 answers
4
admin asked Mar 31, 2020
2,945 views
NIELIT 2017 DEC Scientific Assistant A - Section B: 1
Correct expression tor UDP user datagram length is length of UDP = length of IP- length of IP header's length of UDP= length of UDP-length of UDP header's length of UDP = length of IP+length of IP header's length of UDP = length of UDP+length of UDP header's
Correct expression tor UDP user datagram length islength of UDP = length of IP- length of IP header'slength of UDP= length of UDP-length of UDP header'slength of UDP = le...
User Avatar
Link Copied!