We call the alpha-beta algorithm with a call such as alphabeta_search( alphanbetatree, A ), where the complete tree structure is kept in alphabetatree, and the node to start the search at is the root node A.

Is the following tree a valid representations of the start state of the search tree?

https://mymodules.dtls.unisa.ac.za/pluginfile.php/26375657/mod_folder/content/0/COS3751_2024_alphabeta_start.svg?forcedownload=1