. SAT problem is one of important NP-complete problems with widespread application. In this paper, a new DNA computing model based on self-assembled nanoparticle probes is presented to solve this problem. Its essence is that all possible combinations of variables for given problem are encoded in the recognition zone of self-assembled nanoparticle probes. Major benefits of this method include vast parallelism, extraordinary information density and easy controllable operation. The result reveals the potential of DNA computation based on nanotechnology in solving complex problem.