What is a backtracking algorithm? provide several examples?
Answers
Answered by
0
backtracking is a way out to get optimal solution out of many given alternatives. for example N -queens problem can be easily solved using backtracking
Answered by
5
Hyy frnd☺☺
Here's your answer looking for_____________
__________________________
_____________________
☆Backtracking is an algorithm for capturing some or all solutions to given computational issues, especially for constraint satisfaction issues.
■Examples where backtracking can be used to solve puzzles or problems include: Puzzles such as eight queens puzzle, crosswords, verbal arithmetic, Sudoku, and Peg Solitaire. Combinatorial optimization problems such as parsing and the knapsack problem.
_________________
___hope it helps✔✔✔
mark as ⭐
Here's your answer looking for_____________
__________________________
_____________________
☆Backtracking is an algorithm for capturing some or all solutions to given computational issues, especially for constraint satisfaction issues.
■Examples where backtracking can be used to solve puzzles or problems include: Puzzles such as eight queens puzzle, crosswords, verbal arithmetic, Sudoku, and Peg Solitaire. Combinatorial optimization problems such as parsing and the knapsack problem.
_________________
___hope it helps✔✔✔
mark as ⭐
Similar questions
English,
8 months ago
Hindi,
8 months ago
English,
8 months ago
Business Studies,
1 year ago
Geography,
1 year ago