Combining online and offline knowledge in UCT
Proceedings of the 24th international conference on Machine learning
Note: Bounds on some van der Waerden numbers
Journal of Combinatorial Theory Series A
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Biasing Monte-Carlo simulations through RAVE values
CG'10 Proceedings of the 7th international conference on Computers and games
Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Weak Schur numbers and the search for G.W. Walker's lost partitions
Computers & Mathematics with Applications
Multiple overlapping tiles for contextual monte carlo tree search
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Nested rollout policy adaptation for Monte Carlo tree search
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
A multilevel tabu search with backtracking for exploring weak schur numbers
EA'11 Proceedings of the 10th international conference on Artificial Evolution
| Hi-index | 0.00 |
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 numberWS(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 xyz 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.