Hello
I' ve returned!!, and this time I need its aid in the following thing:
I need to formulate the problem of the Latin squares like a CSP, have the idea of as implementing it in oz... but modeling the problem as a CSP is not to me so obvious. I know clearly for example that if I define a variable Xij representing
each element of the matrix, it could have something as well as:
each element of the matrix, it could have something as well as:
for all (i,j=1..n): Xij it belongs {1..n}
for all i=1..n : all different(Xi1,Xi2,...,Xin)
for all j=1..n : all different(X1j,X2j,...,Xnj)
for all i=1..n : all different(Xi1,Xi2,...,Xin)
for all j=1..n : all different(X1j,X2j,...,Xnj)
Nevertheless what I expose previously does not convince to me, you could help me to express of more suitable form (or of "prettier form") the problem of the
Latin squares like CSP, or taking as base what I showed previously or another
one.
Latin squares like CSP, or taking as base what I showed previously or another
one.
Thank you very much!!
LLama Gratis a cualquier PC del Mundo.
Llamadas a fijos y móviles desde 1 céntimo por minuto.
http://es.voice.yahoo.com
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
