{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360292618967775232.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/978-3-540-87608-3_1"}},{"identifier":{"@type":"URI","@value":"https://link.springer.com/content/pdf/10.1007/978-3-540-87608-3_1"}}],"dc:title":[{"@value":"Single-Player Monte-Carlo Tree Search"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380292618967775106","@type":"Researcher","foaf:name":[{"@value":"Maarten P. D. Schadd"}]},{"@id":"https://cir.nii.ac.jp/crid/1380292618967775104","@type":"Researcher","foaf:name":[{"@value":"H. Jaap van den Herik"}]},{"@id":"https://cir.nii.ac.jp/crid/1380292618967775107","@type":"Researcher","foaf:name":[{"@value":"Mark H. M. Winands"}]},{"@id":"https://cir.nii.ac.jp/crid/1380292618967775232","@type":"Researcher","foaf:name":[{"@value":"Jos W. H. M. Uiterwijk"}]},{"@id":"https://cir.nii.ac.jp/crid/1380292618967775105","@type":"Researcher","foaf:name":[{"@value":"Guillaume M. J. -B. Chaslot"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"03029743"},{"@type":"EISSN","@value":"16113349"},{"@type":"ISBN","@value":"9783540876076"},{"@type":"ISBN","@value":"9783540876083"}],"prism:publicationName":[{"@value":"Lecture Notes in Computer Science"}],"dc:publisher":[{"@value":"Springer Berlin Heidelberg"}],"prism:publicationDate":"2008","prism:startingPage":"1","prism:endingPage":"12"},"reviewed":"false","dc:rights":["https://www.springernature.com/gp/researchers/text-and-data-mining","https://www.springernature.com/gp/researchers/text-and-data-mining"],"url":[{"@id":"https://link.springer.com/content/pdf/10.1007/978-3-540-87608-3_1"}],"createdAt":"2008-09-23","modifiedAt":"2024-05-10","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360294643799692288","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Computing Games: Bridging the Gap Between Search and Entertainment"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848659221154048","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Efficacy of a causal value function in game tree search"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/978-3-540-87608-3_1"},{"@type":"CROSSREF","@value":"10.1080/17445760.2015.1064918_references_DOI_3wrz22F4j1W7jCnWneMzU8LPr5F"},{"@type":"CROSSREF","@value":"10.1109/access.2021.3079356_references_DOI_3wrz22F4j1W7jCnWneMzU8LPr5F"}]}