1: holded 0: not holded binary AND: ==O-- binary OR: ==>-- So the generalized riddle for any monotone boolean function can be easily solved because all bool

1: holded 0: not holded binary AND: ==O-- binary OR: ==>-- So the generalized riddle for any monotone boolean function can be easily solved because all boolean monotone functions can be built up of binary ORs and ANDs. (Edit: accidentally mixed up OR and AND, fixed now.)