Ribonucleic acid (RNA) design is the inverse of RNA folding. RNA folding aims to identify the most likely secondary structure into which a given strand of nucleotides will fold. RNA design algorithms, on the other hand, attempt to design a strand of nucleotides that will fold into a specified secondary structure. Despite the apparent NP-hard nature of RNA design, promising results can be achieved when formulated as a combinatorial optimization problem and approached with simple heuristics. The main focus of this paper is to describe an RNA design algorithm based on simulated annealing. Additionally, noteworthy features and results will be presented herein.