There is a topic Let's play tennis by Daniel. He proposes to place a court in the North-South direction. My proposal is to create a court to play tennis in the East-West direction too.

You have to print a tennis court, but you have to do it in the fewest bytes possible because of confidential reasons.

Tennis court

------x------
| | x | |
| |--x--| |
| | x | |
------x------

Original rules are:

• no extra spaces;


• tabs would be unfair;


• only one optional trailing newline is allowed.

This is code-golf, so shortest code in bytes wins!

Canvas, 13 12 bytes

«ω↕9:gＷ：ｔＣ‟┼

quad-palindromizes a compressed corner of the field.

Try it here!

11 bytes with uppercase Xes, using the fact that / compresses better than x and palindromizing would result in overlapping / and its mirror , which results in X

Python 3, 75 bytes

s='-'*6;p='| |';w=s+'x'+s;a=p+' x '+p;print(w,a,p+w[4:9]+p,a,w,sep='n')

Probably golfable - I've never really tried kolmogorov-complexity challenges before.

Try it online!

In Python 2 I could get it to 76 bytes

s='-'*6;p='| |';w=s+'x'+s;a=p+' x '+p
for i in w,a,p+w[4:9]+p,a,w:print i

Perl 5, 55 bytes

say$_,x,~~reverse for('-'x6,'| 'x2,'| |--')[0..2,1,0]

Try it online!

Charcoal, 15 bytes

↑²←⁶↓xx→x²↑²‖Ｏ¬

Try it online! Link is to verbose version of code. By way of explanation I will show the result after each of the drawing commands up to the final reflection:

↑² |
 |

 ------
←⁶ |
 |

 x------
↓xx x |
 |

 x------
→x² x |
 x-- |

 x------
↑² x | |
 x--| |

Pip -l, 42 bytes

This is gonna get a lot shorter.

Y"| |--"Yy.'x.RVyYP[yR['|s]'-yR'-sy]RV@<y

Try it online!

Dyalog APL, 36 bytes

(⌽,'x',⊢)(⊢⍪'--| |'⍪⊖)'-'⍪1 6⍴' |'

Try it online!

With a little help from Adám