 Due to the Hamming distance properties of Gray codes, they are sometimes used in genetic algorithms.They are very useful in this field, since mutations in the code allow for mostly incremental changes, but occasionally a single bit-change can cause a big leap and lead to new properties.Gray codes are also used in labelling the axes of Karnaugh maps as well as in Händler circle graphs, both graphical methods for logic circuit minimization.