In this paper we experiment with the use of Reduced and Ordered Binary Decision Diagrams (ROBDDs) as a possible representation for evolving Boolean functions in the context of evolvable hardware. A number of test functions were evolved using ROBDDs. In order to obtain solutions more easily and with lower complexity, we experimented with the use of cube transformations on the target functions. Although the setup still needs tuning, we argue that the use of domain transformations combined with GAs has potential in EHW applications.