function alphabeta(node, a, B, turn) if node is a terminal node return the utility score of node if turn == MAX V := - 00 for each child of node v := max (v, alphabeta (child, a, B, MIN)) a := max(a, v) if B s a break; return v else V := 00 for each child of node v := min(v, alphabeta (child, a, B, MAX)) B := min(ß, v) if B s a break; return v

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

I need this psuedocode to be written in Java. Thank you!

function alphabeta(node, a, B, turn)
if node is a terminal node
return the utility score of node
if turn == MAX
V := - 00
for each child of node
vV := max (v, alphabeta (child, a, B, MIN))
a := max (a, v)
if B s a
break;
return v
else
V := 00
for each child of node
v := min (v, alphabeta (child, a, B, MAX))
B := min(B, v)
if B s a
break;
return v
Transcribed Image Text:function alphabeta(node, a, B, turn) if node is a terminal node return the utility score of node if turn == MAX V := - 00 for each child of node vV := max (v, alphabeta (child, a, B, MIN)) a := max (a, v) if B s a break; return v else V := 00 for each child of node v := min (v, alphabeta (child, a, B, MAX)) B := min(B, v) if B s a break; return v
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Polynomial time
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education