H. Abbott and D. Hanson, A problem of Schur and its generalizations, Acta Arith, vol.20, pp.175-187, 1972.

P. F. Blanchard, F. Harary, and R. Reis, Partitions into sum-free sets, Integers 6, 2006.

P. Bornsztein, On an extension of a theorem of Schur, Acta Arithmetica, vol.101, issue.4, pp.395-399, 2002.
DOI : 10.4064/aa101-4-6

T. Brown, B. M. Landman, and A. Robertson, Bounds on some van der Waerden numbers, Journal of Combinatorial Theory, Series A, vol.115, issue.7, pp.1304-1309, 2008.
DOI : 10.1016/j.jcta.2008.01.005

T. Cazenave, Nested Monte-Carlo search, IJCAI, pp.456-461, 2009.
DOI : 10.1109/ipdps.2009.5161122
URL : https://hal.archives-ouvertes.fr/hal-01436286

T. Cazenave and F. Teytaud, Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows, Lecture Notes in Computer Science, vol.7219, pp.42-54, 2012.
DOI : 10.1007/978-3-642-34413-8_4
URL : https://hal.archives-ouvertes.fr/hal-01406457

P. Drake, The Last-Good-Reply Policy for Monte-Carlo Go, ICGA Journal, vol.32, issue.4, pp.221-227, 2009.
DOI : 10.3233/ICG-2009-32404

S. Eliahou, J. M. Marín, M. P. Revuelta, and M. I. Sanz, Weak Schur numbers and the search for G.W. Walker???s lost partitions, Computers & Mathematics with Applications, vol.63, issue.1, pp.175-182, 2012.
DOI : 10.1016/j.camwa.2011.11.006

C. Fonlupt, D. Robilliard, V. Marion-poty, and A. Boumaza, A multilevel tabu search with backtracking for exploring weak Schur numbers. Artificial Evolution EA'2011, Lecture Notes in Computer Science, vol.7401, pp.109-119, 2012.

H. Fredricksen and M. M. Sweet, Symmetric sum-free partitions and lower bounds for Schur numbers, Electr. J. Comb, vol.7, issue.32, 2000.

S. Gelly and D. Silver, Combining online and offline knowledge in UCT, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.273-280, 2007.
DOI : 10.1145/1273496.1273531
URL : https://hal.archives-ouvertes.fr/inria-00164003

R. , L. Bras, C. P. Gomes, and B. Selman, From streamlined combinatorial search to efficient constructive procedures, Proceedings of the 15th international conference on Artificial Intelligence, AAAI'12, 2012.

R. Rado, Some Solved and Unsolved Problems in the Theory of Numbers, The Mathematical Gazette, vol.25, issue.264, pp.72-77, 1941.
DOI : 10.2307/3606971

A. Rimmel and F. Teytaud, Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
DOI : 10.1007/978-3-642-12239-2_21
URL : https://hal.archives-ouvertes.fr/inria-00456422

A. Rimmel, F. Teytaud, and T. Cazenave, Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
DOI : 10.1287/opre.35.2.254
URL : https://hal.archives-ouvertes.fr/inria-00563668

A. Rimmel, F. Teytaud, and O. Teytaud, Biasing Monte-Carlo Simulations through RAVE Values, Computers and Games, pp.59-68, 2010.
DOI : 10.1007/978-3-642-17928-0_6
URL : https://hal.archives-ouvertes.fr/inria-00485555

C. D. Rosin, Nested rollout policy adaptation for Monte Carlo tree search 18. I. Schur. ¨ Uber die kongruenz x m + y m ? z m (mod p), IJCAI, pp.649-654114, 1916.

G. Walker, A problem in partitioning, Amer. Math. Monthly, vol.59, p.253, 1952.