The Wilf–Zeilberger (abbr. WZ) theory [1]}, [2]}, [3]} has become a bridge between symbolic computation and combinatorics.
Through this bridge, not only classical combinatorial identities from handbooks and long-standing conjectures in combinatorics, such as Gessel's conjecture [4]}, [5]} and \(q\) -TSPP conjecture [6]}, are proved algorithmically, but also some new identities and conjectures related to mathematical constants, such as \(\pi \)  and zeta values, are discovered via computerized guessing [7]}, [8]}, [9]}, [10]}.
