Talk:Ramsey's theorem: Difference between revisions
→Revision of Task Description needed?
(→Revision of Task Description needed?: algorithm in pseudo-code?) |
|||
Line 21:
:Suggest you add a proper algorithm in pseudo-code that implementers can follow as R.C. isn't usually about creating your own algorithm for a non-trivial task. For example [[Bulls and cows/Player]] and [[http://rosettacode.org/wiki/Quaternion_type]] describe at least one way of doing things. (But then [[24 game/Solve]] does not, although it did come with a Python solution that people seemed to understand). --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 17:30, 28 October 2013 (UTC)
:MATHPROG gives notice of its intention to sue for libel those accusing it of cheating. It firmly asserts that it solves the task!! The task is to create a 17x17 matrix G of binary variable where G[a,b] = G[b,a] = 1 means a is connected to b. Then create a list N[a,b,c,d] of all combinations of 4 nodes from G. For all N: G[a,b] + G[a,c] + G[a,d] + G[b,c] + G[b,d] + G[c,d] must be at least 1 (at least 1 connected) and no more than 5 (at least 1 not connected) as the values in G are changed. It may be better to require other values so that solutions can work up to 17x17. R(3,3) would only require 5x5 and R(3,4) would only require 9x9 for G.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 13:51, 30 October 2013 (UTC)
| |||