2PATS-tileset-search

From self-assembly wiki
Revision as of 08:34, 30 March 2014 by \('"2\)'"7
(\(1) \)2 | \(3 (\)4) | \(5 (\)6)
Jump to navigation Jump to search


Name

2PATS-tileset-search

Description

A distributed program to find all tilesets with a maximum size which can self-assemble a given pattern in a directed aTAM system. The program uses a client-server model to distribute the processing.

Retrieved from "http://self-assembly.net/wiki/index.php?title=2PATS-tileset-search&oldid=1088"