To run TSCP's benchmark function, just type "bench" at the "tscp>"
prompt.

You can download TSCP 1.73's source code and a Windows executable from
here.
I built the executable with Visual C++ 6.0 (set to Maximize Speed). If you
build your own executable, please make sure it reports 550822 nodes
searched at the end of the benchmark.

An executable for the [PowerPC] Macintosh has been built by "MrNSX" using
MrC 5.0 (with all optimizations enabled except vectorization). You can
download it
here.

To report a score, just e-mail it to me at
tckerrigan@attbi.com.
Please include what processor, compiler, and compiler settings
you used.

TSCP's MIPS (Millions of Instructions Per Second) numbers are based on the
fact that it takes 11,233 million MIPS (SGI workstation processor)
instructions to execute the bench() function.

I used an SGI workstation and the perfex command to collect some data
about TSCP. For comparison, I also ran perfex on gcc and gzip (two
SPECint2000 programs).

gcc is considered a branch intensive program. As you can see from this
graph, TSCP has even more branches and they're harder to predict, so it's
a good test of a processor's BPU and ability to recover from mispredicted
branches. TSCP also has relatively high ILP, so it tests the
processor's instruction scheduler. It clearly fits in L1 cache, so it
doesn't test a computer's L2 cache or main memory performance. Basically,
TSCP measures a processor core's worst case integer performance. It may be
a good predictor for compilers, other AI programs, and other branch
intensive code.