On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations. Altḧofer, I. Technical Report Friedrich-Schiller Univ., Jena, 2008. bibtex @techreport{ Althofer2008,
address = {Jena},
author = {Altḧ{o}fer, Ingo},
file = {::},
institution = {Friedrich-Schiller Univ.},
keywords = {000nonmcts,computer go,experimental analysis,go,laziness,mcts,monte-carlo game tree search},
title = {{On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations}},
year = {2008}
}
Downloads: 0
{"_id":{"_str":"52b1a5ba9eb585cc26003e6b"},"__v":0,"authorIDs":[],"author_short":["Altḧofer, I."],"bibbaseid":"althofer-onthelazinessofmontecarlogametreesearchinnontightsituations-2008","bibdata":{"html":"<div class=\"bibbase_paper\"> \n\n\n<span class=\"bibbase_paper_titleauthoryear\">\n\t<span class=\"bibbase_paper_title\"><a name=\"Althofer2008\"> </a>On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations.</span>\n\t<span class=\"bibbase_paper_author\">\nAltḧofer, I.</span>\n\t<!-- <span class=\"bibbase_paper_year\">2008</span>. -->\n</span>\n\n\nTechnical Report \nFriedrich-Schiller Univ., Jena, 2008.\n\n\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content\">\n \n \n \n <a href=\"javascript:showBib('Althofer2008')\"\n class=\"bibbase link\">\n <!-- <img src=\"http://www.bibbase.org/img/filetypes/bib.png\" -->\n\t<!-- alt=\"On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations [bib]\" -->\n\t<!-- class=\"bibbase_icon\" -->\n\t<!-- style=\"width: 24px; height: 24px; border: 0px; vertical-align: text-top\"><span class=\"bibbase_icon_text\">Bibtex</span> -->\n BibTeX\n <i class=\"fa fa-caret-down\"></i></a>\n \n \n \n \n\n \n \n \n</span>\n\n<div class=\"well well-small bibbase\" id=\"bib_Althofer2008\"\n style=\"display:none\">\n <pre>@techreport{ Althofer2008,\n address = {Jena},\n author = {Altḧ{o}fer, Ingo},\n file = {::},\n institution = {Friedrich-Schiller Univ.},\n keywords = {000nonmcts,computer go,experimental analysis,go,laziness,mcts,monte-carlo game tree search},\n title = {{On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations}},\n year = {2008}\n}</pre>\n</div>\n\n\n\n</div>\n","downloads":0,"keyword":["000nonmcts","computer go","experimental analysis","go","laziness","mcts","monte-carlo game tree search"],"bibbaseid":"althofer-onthelazinessofmontecarlogametreesearchinnontightsituations-2008","role":"author","year":"2008","type":"techreport","title":"On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations","keywords":"000nonmcts,computer go,experimental analysis,go,laziness,mcts,monte-carlo game tree search","key":"Althofer2008","institution":"Friedrich-Schiller Univ.","id":"Althofer2008","file":"::","bibtype":"techreport","bibtex":"@techreport{ Althofer2008,\n address = {Jena},\n author = {Altḧ{o}fer, Ingo},\n file = {::},\n institution = {Friedrich-Schiller Univ.},\n keywords = {000nonmcts,computer go,experimental analysis,go,laziness,mcts,monte-carlo game tree search},\n title = {{On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations}},\n year = {2008}\n}","author_short":["Altḧofer, I."],"author":["Altḧofer, Ingo"],"address":"Jena"},"bibtype":"techreport","biburl":"http://mcts.ai/bib/MendeleyMCTSCollection_28032013.bib","downloads":0,"search_terms":["laziness","monte","carlo","game","tree","search","non","tight","situations","altḧofer"],"title":"On the Laziness of Monte-Carlo Game Tree Search in Non-tight Situations","year":2008,"dataSources":["kShoLeSRQfAaM4J9K"]}