Skip to Main content Skip to Navigation
Conference papers

Investigating Monte-Carlo Methods on the Weak Schur Problem

Abstract : Nested Monte-Carlo Search (NMC) and Nested Rollout Policy Adaptation (NRPA) are Monte-Carlo tree search algorithms that have proved their efficiency at solving one-player game problems, such as morpion solitaire or sudoku 16x16, showing that these heuristics could potentially be applied to constraint problems. In the field of Ramsey theory, the weak Schur number WS(k) is the largest integer n for which their exists a partition into k subsets of the integers [1, n] such that there is no x < y < z all in the same subset with x + y = z. Several studies have tackled the search for better lower bounds for the Weak Schur numbers WS(k), k ≥ 4. In this paper we investigate this problem using NMC and NRPA, and obtain a new lower bound for WS(6), namely WS(6) ≥ 582.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-01406479
Contributor : Fabien Teytaud <>
Submitted on : Thursday, December 1, 2016 - 11:24:53 AM
Last modification on : Friday, July 16, 2021 - 11:45:19 AM
Long-term archiving on: : Wednesday, March 22, 2017 - 11:54:25 PM

File

evo13.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Shalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, et al.. Investigating Monte-Carlo Methods on the Weak Schur Problem. EvoCop, Apr 2013, Vienne, Austria. pp.191 - 201, ⟨10.1007/978-3-642-37198-1_17⟩. ⟨hal-01406479⟩

Share

Metrics

Record views

232

Files downloads

324