Can a Computer Implementation Based on Set Grammars Allow Emergent Shapes?
Luís Romão · eCAADe proceedings · 2005
In a previous paper, (Romão 2005) it was shown that a designer could create his own rules and combine them for application in a deterministic way using a computational device based on Set Grammars called SGtools. Using this device, the designer can assess the results in a visual manner and then change the rules without any knowledge of a programming language. This work examines whether SGtools can deal with emergence by coupling the representational abilities of Set Grammars with the search power of hybrid algorithm inspired on Genetic and Taboo search algorithms. The use of this search algorithm enhances the ability of the designer to explore solutions in practical time thereby enabling him/her to find unexpected, emergent solutions.