Demonstrate a lower bound for the Ramsey number R(4,4) A special case of Ramsey's theorem says the following: whenever we color the edges of the complete graph on 18 vertices red and blue, there is a monochromatic clique of size 4. 

In language that avoids graph theory: suppose we place 18 points around a circle and draw all possible line segments connecting them in one of two colors: either red or blue. No matter how this is done, it's always possible to choose 4 of the points such that all 6 line segments between them are the same color: either all 6 are red or all 6 are blue.

Moreover, 18 is the least number for which this will work. For 17 points, we can color the line segments so that it's impossible to choose 4 points in this way.

Your goal is to print one such coloring. Your output must be a 17 by 17 adjacency matrix in which the (i,j) entry gives the color of the line segment joining points i and j. It must be in a format such as the one below:

  R R B R B B B R R B B B R B R R
R   R R B R B B B R R B B B R B R
R R   R R B R B B B R R B B B R B
B R R   R R B R B B B R R B B B R
R B R R   R R B R B B B R R B B B
B R B R R   R R B R B B B R R B B
B B R B R R   R R B R B B B R R B
B B B R B R R   R R B R B B B R R
R B B B R B R R   R R B R B B B R
R R B B B R B R R   R R B R B B B
B R R B B B R B R R   R R B R B B
B B R R B B B R B R R   R R B R B
B B B R R B B B R B R R   R R B R
R B B B R R B B B R B R R   R R B
B R B B B R R B B B R B R R   R R
R B R B B B R R B B B R B R R   R
R R B R B B B R R B B B R B R R  


The exact output above represents a valid coloring, so it is perfectly acceptable. But you have the following additional freedom to do something else:


You may print the adjacency matrix for any graph that satisfies the Ramsey condition, not just this one. (For example, any permutation of the rows with a corresponding permutation of the columns gives another acceptable output. I haven't checked if any non-isomorphic colorings exist.)
You may use any two distinct, non-whitespace characters in place of R and B to represent the two colors.


However, the spacing must appear exactly as in the example above: a space between cells in the same row, spaces in the diagonal entries, and newlines after each row. Leading and trailing spaces and newlines are allowed (but the entries of the adjacency matrix should be aligned with each other).

This is code-golf, so the shortest code in bytes wins. Because this is kolmogorov-complexity, hardcoding the output is allowed. Otherwise,
 standard loopholes apply.
Python 3, 56 bytes



s=' '+bin(53643)[2:]
for _ in s:print(*s);s=s[-1]+s[:-1]


Try it online!



Python 3, 56 bytes



s=' 1101000110001011'*16
while s:print(*s[:17]);s=s[16:]


Try it online!



Python 2, 64 bytes



for k in range(289):print'\n'[k%17:]+' ab'[(k/17-k%17)**8%17%7],


Try it online!