As The Riddler proposed for several weeks a CrossProduct puzzle when 3 x n one-digit integers have to be deduced from their rowwise and columnwise products, I attempted at writing an R solver by applying a few basic rules repeatedly, which worked for the first two puzzles, if not for the earlier one I solved by paper & pen (mostly) a few weeks ago. The rules I used were to spot unique entries, forced entries by saturation, and forced digits (from the prime factor decomposition) again by saturation. Any further rule to add to the solved? (The R code is currently rather ugly!) Please, some more!