Sometimes death blossom is too costly-memory and high-complexity, so we can change into another algorithm to enhance and optimize the performance.
Searcher Death blossom:
collect all ALSes
for each candidate in all candidates
try to set candidate
for each ALS combinations in all combinations for all ALSes when relative
try to eliminate candidate in these ALSes
for each digit in all digits in these ALSes
if a certain cell cannot contain any possibilities because of these ALSes
Death blossom found
Searcher Complex fish:
for each digit in 1 to 9
eliminations = POM search eliminations
if eliminations is not an empty set
for each size in 2 to 5
for each base set in all subsets in all sets whose size is size
for each elimination in these eliminations
try to set elimination
for each cover sets in all subsets in structure whose size is size - 1
set = new set of same set in eliminations that contains elimination
if set is not empty
cover sets += set
complex fish found