A modification of the binary weight CHIR algorithm is presented, where
by a zero state is added to the possible binary weight states. This me
thod allows obtaining solutions with reduced connectivity, by offering
disconnections in addition to the excitatory and inhibitory connectio
ns. The algorithm was examined via extensive computer simulations for
the restricted cases of parity, symmetry, and teacher problems, which
show similar convergence rates to those presented for the binary CHIR2
algorithm, however, with reduced connectivity. Moreover, this method
expands the set of problems solvable via the binary weight network con
figuration with no additional parameter requirements.