A Quasi-mechanical Method for Solving the Rectangle Covering Problem An Approach to Tackling NP Hard Problems

Abstract

An approximate algorithm is proposed for solving the Rectangle Covering Problem based on the quasi-mechanical concept. The phenomenon due to universal gravitation and screen has been simulated. It is pointed out that valuable approximate algorithms can be obtained for large numbers of NP hard problems by following the quasi-mechanical procedure. Behind the quasi-mechanical procedure are the strategies in the priority method in modern recursive theory.