{"_id":{"_str":"534279610e946d920a001389"},"__v":1,"authorIDs":[],"author_short":["Ballard, B. W."],"bibbaseid":"ballard-theminimaxsearchprocedurefortreescontainingchancenodes-1983","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Bruce","W."],"propositions":[],"lastnames":["Ballard"],"suffixes":[]}],"journal":"Artificial Intelligence","pages":"327–350","title":"The *-minimax Search Procedure for Trees Containing Chance Nodes","volume":"21","year":"1983","bibtex":"@article{ballard,\n\tAuthor = {Bruce W. Ballard},\n\tJournal = {Artificial Intelligence},\n\tPages = {327--350},\n\tTitle = {The {*-minimax} Search Procedure for Trees Containing Chance Nodes},\n\tVolume = {21},\n\tYear = {1983}}\n\n","author_short":["Ballard, B. W."],"key":"ballard","id":"ballard","bibbaseid":"ballard-theminimaxsearchprocedurefortreescontainingchancenodes-1983","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.cs.toronto.edu/cogs/bib/standard-long.bib","downloads":0,"keywords":[],"search_terms":["minimax","search","procedure","trees","containing","chance","nodes","ballard"],"title":"The *-minimax Search Procedure for Trees Containing Chance Nodes","year":1983,"dataSources":["2cjnbEWxd35GBeqEe"]}