24. PuK-Workshop: Planung/Scheduling und Konfigurieren/Entwerfen: Finding the Needle in the Haystack with Heuristically Guided Swarm Tree Search

Edelkamp, Stefan; Kissmann, Peter; Sulewski, Damian; Messerschmidt, Hartmut

doi:10.17875/gup2010-1477

Cited by 1 publication

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Compared to the pure random play-outs, an increase of 50% in the average score is achieved. The proposed TabuColorRandom strategy has also been successfully applied in Nested Monte-Carlo Search (Cazenave, 2009) and HGSTS (Edelkamp et al, 2010). Second, we observed that exploiting works better than exploring at short time controls.…”

Section: Comparison On the Standardized Test Setmentioning

confidence: 72%

“…The main contribution is therefore that we successfully adapted MCTS for a one-player game. Inspired by our approach, two other Monte-Carlo-based approaches, Nested Monte-Carlo Search (Cazenave, 2009) and Heuristically Guided Swarm Tree Search (Edelkamp et al, 2010), broke our record subsequently. At the time of publishing this thesis SP-MCTS, with parameters tuned by the Cross-Entropy Method and with time equally distributed over the consecutive positions, scored 78,012 points on the test set, which is currently the third highest score (2010).…”

Section: One-player Gamesmentioning

confidence: 98%

“…Further details about this program are not known. Later in 2010 this record was claimed to be broken with 84,718 points by using a method called Heuristically Guided Swarm Tree Search (HGSTS) (Edelkamp et al, 2010), which is a parallelized version of MCTS.…”

Section: Related Workmentioning

confidence: 99%

“…In this case, it implies that all positions score almost equally low. The proposed TabuColorRandom strategy has also been successfully applied in Nested Monte-Carlo Search (Cazenave, 2009) and HGSTS (Edelkamp et al, 2010).…”

Section: Simulation Strategymentioning

confidence: 99%

See 3 more Smart Citations

Selective search in games of different complexity

Schadd

View full text Add to dashboard Cite

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

Section: Comparison On the Standardized Test Setmentioning

confidence: 72%

Section: One-player Gamesmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Section: Simulation Strategymentioning

confidence: 99%

See 2 more Smart Citations