[untitled]
1 pointsby atnnn0 comments
row('species').contains(function(s){ r.expr(['Saiyan', 'Human', 'Android']).contains(s) })
Or also as: row('species').setIntersection(['Saiyan', 'Human', 'Android']).isEmpty().not()
The succintness of ReQL depends on that of the host language. JavaScript's bulky syntax for functions and lack of operator overloading make queries a lot more cluttered.
Independent of the lines dropped, there are eight (2n) ways to pick adjacent points and sixteen (n^2) different combinations of points.
There are four (n) adjacent points iif the points lie on the same half of the circle (proof by interactive visualization).
So the answer is eight sixteenths (2n/2^n).