The Maximum Density Still Life problem fills a finite Game of Life board with a stable pattern of cells that has as many live cells as possible. Although simple to state, this problem is computationally challenging for any but the smallest sizes of board. Especially difficult is to prove that the maximum number of live cells has been found. Various approaches have been employed. The most succes...

Still-life is a challenging problem for CP techniques. We show how to use the global case constraint to construct ad-hoc constraints which can provide stronger propagation than existing CP models. We also demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are on...

The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of Life. We reformulate the problem into one of minimising “wastage” rather than maximising the number of live cells. This reformulation allows us to compute strong upper bounds on the number of live cells. By combining this ...

OBJECTIVE The aim of this report is to describe a fatal disseminated thrombotic micoangiopathy with renal, pancreatic, and cerebral involvement in a patient with recently diagnosed adult's Still disease (ASD). CASE REPORT A previously healthy 15 year old girl was admitted to our hospital. According to the clinical and laboratory data the diagnosis of adult's still Disease was established. The...