The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962. In this paper we propose an evolutionary approach to this problem. We will focus on the representational issues, proposing alternative ways of codifying and interpreting Turing Machines. These alternative representations take advantage of the existence of equivalent Turing machine sets. The experimental results show that the proposed representations provide improvement over the “standard” genetic codification.