The Hamiltonian Path Problem is to start at node 1, end at node 5,and visit each node exactly once. (For those without a bacterial computer the answer is 1→4→7→2→3→6→5).
Last year we looked at how a research team had genetically engineered Escherichia coli, (E. coli), bacteria to solve a classic mathematical puzzle known as the burnt pancake problem. At the time the researchers indicated their intention to adapt 'bacterial computers' for other, related math problems, and it appears they’ve been true to their word by solving another classic mathematical problem, the Hamiltonian Path Problem.
Other Images from this Gallery