Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

15
  • \$\begingroup\$ A great start :) \$\endgroup\$
    – user9206
    Commented Nov 5, 2014 at 10:20
  • 2
    \$\begingroup\$ @Lembik Now I can beat almost (limited by computational time) anyone claiming any score below 2. =) \$\endgroup\$
    – justhalf
    Commented Nov 5, 2014 at 12:53
  • \$\begingroup\$ In that case, can you beat 19/10 ? \$\endgroup\$
    – user9206
    Commented Nov 5, 2014 at 14:59
  • \$\begingroup\$ @Lembik I don't think I can. It requires n >= 31, which implies I'd need to check up to 2^(2n-3) = 2^59 combinations of 31-dimensional vector. Won't finish in our lifetime =D \$\endgroup\$
    – justhalf
    Commented Nov 5, 2014 at 15:03
  • 2
    \$\begingroup\$ Can you prove that you can always obtain a matrix of n*(2n-3) \$\endgroup\$
    – xnor
    Commented Nov 5, 2014 at 19:00