Hello,
For an exhaustive CHAID, you need the options:
LEVTHRESH1= Specifies the maximum number of computations to perform in an exhaustive search for a categorical predictor
LEVTHRESH2= Specifies the number of computations to perform before the splitter uses the fastest greedy search
See here: https://support.sas.com/documentation/onlinedoc/stat/141/hpsplit.pdf
Read also the section "Splitting Strategy" on pp. 4607-4608.
Good luck,
Koen
... View more