This makes it trivial to prove that the complete set of decominoes cannot be packed into a rectangle, and that not all decominoes can be tiled.
This makes it trivial to prove that the complete set of octominoes cannot be packed into a rectangle, and that not all octominoes can be tiled.
Year 2000 problem | Waring's problem | The Final Problem | The Problem with Popplers | Smithfield Packing Company | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Species problem | problem solving | Problem gambling | Packing problem | packing problem | Cumberland Packing Corporation | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | Weber problem | Undecidable problem | Travelling salesman problem | travelling salesman problem | The Problem of Thor Bridge | The Problem of the Media: U.S. Communication Politics in the 21st Century | The Problem of Social Cost | Tarski's circle squaring problem | Steiner tree problem | Sphere packing |
His results were useful for computer simulations of hard particle systems and for packing problems using Monte Carlo simulations.
•
His results were useful for the study of the phase behavior of hard particles and for the packing problem using Monte Carlo simulations.