In genetics and breeding, we typically have two parent genotype (may or may not be the same) which can produce a set of offspring with certain probability (assuming simple Mendelian inheritance).
I am looking for a way to determine given a set of parent, what is the shortest path to a particular offspring genotype (and yes, I am talking about breeding flowers in Animal Crossing!).
This seems to be very similar to the shortest path problem, but now the edges is given by two nodes interacting with each other. Is there a way to achieve this?
I was directed to here from stack overflow. My original post was at stackoverflow.
Edit: A genotype is a word of four groups of two chars. These groups can be xx, Xx or XX where x = {r,b,y,w}. For example; RRbbyyWw is a red flower.
An offspring of two parents inherits a random combination of letters. For example, if parent A has genotype RRbbyyWw and parent B has genotype rrBBYyww then the offspring might be RRBbyyWw.
If, by luck, the offspring has inherited rRBbyyWw (rR is not allowed) then it is reordered so it becomes RrBbyyWw.
Now, the question is; given genotypes of a set of parents and a target genotype, is there an algorithm which can generate the shortest path in terms of pairing parents?
Edit2: I am aware of the data mining done by others (e.g. here and here.) Therefore, I am not looking for a particular path to get to certain result, rather a method to find a (shortest) path.