Pursuing bounds of ir(Qn)

So far the determination of the exact value of ir(Q,,), the lower irredundance number of the Queen’s graph, has eluded many combinatorial efforts. In fact there is no known tight bound on this value. This paper discusses a genetic algorithm approach to bounding this number. Preliminary computed bounds are presented for ir(Q,,).