in Technology by

The search algorithm which is similar to the minimax search, but removes the branches that don't affect the final output is known as__.

  1. Depth-first search
  2. Breadth-first search
  3. Alpha-beta pruning
  4. None of the above

1 Answer

0 votes
by

Answer: c. Alpha-beta pruning

Explanation: Alpha-beta pruning algorithm is the modified version of the Minimax algorithm and returns the same moves as the original algorithm, but it removes all those nodes/branches that do not affect the final decision.

Related questions

0 votes
0 votes
    There is feedback in final stage of backpropagation algorithm? (a) yes (b) no The question was posed to me ... Neural Networks of Neural Networks Please answer the above question....
asked Sep 3, 2022 in Education by JackTerrance
0 votes
    I have have no error in my code. But my condition, finally don't work. const togglePeronsHandler = ... Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked Apr 24, 2022 in Education by JackTerrance
0 votes
    I have have no error in my code. But my condition, finally don't work. const togglePeronsHandler = ... Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked Apr 22, 2022 in Education by JackTerrance
0 votes
    I have have no error in my code. But my condition, finally don't work. const togglePeronsHandler = ... Questions for Interview, JavaScript MCQ (Multiple Choice Questions)...
asked Apr 22, 2022 in Education by JackTerrance
0 votes
    The final bit of output that summaryRprof() provides is the ______ interval and the total runtime. (a) response ... of R Programming Select the correct answer from above options...
asked Feb 13, 2022 in Education by JackTerrance
0 votes
    ________ are similar to matrices but can have more than two dimensions. (a) Functions (b) Packages (c) Arrays ... Out of R Programming Select the correct answer from above options...
asked Feb 15, 2022 in Education by JackTerrance
0 votes
    ________ function is similar to the existing subset() function in R but is quite a bit faster. (a) ... Operations of R Programming Select the correct answer from above options...
asked Feb 12, 2022 in Education by JackTerrance
0 votes
    The complexity of a linear search algorithm is (a) O(n) (b) O(log n) (c) O(n2) (d) ... Questions and Answers, Database Interview Questions and Answers for Freshers and Experience...
asked Oct 11, 2021 in Education by JackTerrance
0 votes
    The complexity of Binary search algorithm is (a) O(n) (b) O(log ) (c) O(n2) (d) O(n ... Questions and Answers, Database Interview Questions and Answers for Freshers and Experience...
asked Oct 11, 2021 in Education by JackTerrance
0 votes
    The Worst case occur in linear search algorithm when (a) Item is somewhere in the middle of the array ... , Database Interview Questions and Answers for Freshers and Experience...
asked Oct 11, 2021 in Education by JackTerrance
0 votes
    The Average case occur in linear search algorithm (a) When Item is somewhere in the middle of the ... from Sorting in portion Query Processing Techniques of Database Management...
asked Oct 10, 2021 in Education by JackTerrance
0 votes
    Which of the following function of Array object removes the last element from an array and returns that element? push() delete() pop() link()...
asked Dec 24, 2020 in Technology by JackTerrance
0 votes
    Big multinational companies are providing us with search engines to easily search for data for free. But they are also taking ... habits as well as choices. 1) True 2) False...
asked Dec 29, 2020 in Technology by JackTerrance
...