#Train constraint programming#
This is a learning example for prolog/eclipse.
Question: Given n straight and k bent train tracks, how many figures are possible to lay?
OK, we aren't yet at the train problem. First, we worked with matches.
#Train constraint programming#
This is a learning example for prolog/eclipse.
Question: Given n straight and k bent train tracks, how many figures are possible to lay?
OK, we aren't yet at the train problem. First, we worked with matches.