Abstract
Since 2014, SYNTCOMP gathers benchmarks and solvers for different flavors of Church's synthesis problem. These include parity games as well as Gale-Stewart games with LTL(f) defined objectives. I will present the current state of the competition including tools being actively supported and developed as well as trends in algorithms to solve the synthesis problem efficiently.