From rubyforge at lokorin.org  Wed Jun 20 11:25:39 2007
From: rubyforge at lokorin.org (Andreas Launila)
Date: Wed, 20 Jun 2007 17:25:39 +0200
Subject: [gecoder-users] [ANN] Gecode/R 0.2.0
Message-ID: <467946F3.7080000@lokorin.org>

The first public release of Gecode/R. Feel free to play around with it
and give feedback. The API and syntax will probably change, so don't use
it for production code.

-- 
Andreas Launila

From rubyforge at lokorin.org  Tue Jun 26 16:33:36 2007
From: rubyforge at lokorin.org (Andreas Launila)
Date: Tue, 26 Jun 2007 22:33:36 +0200
Subject: [gecoder-users] [ANN] Gecode/R 0.3.0
Message-ID: <46817820.5010908@lokorin.org>

Gecode/R 0.3.0 has been released.

The new release fleshes out the existing constraints with options such
as reification and adds boolean variables along with their basic
constraints. It also adds some different ways to iterate through
solutions and some syntactic sugar for combining constraints.

== Changes (since 0.2.0) ==

* The constructor of Gecode::Model no longer has to be called by classes
inheriting from it.
* Added Model#reset! which resets a model after search.
* Added Model#solution which passes the first solution to a block and
returns the result of that block.
* Added Model#each_solution which iterates over each solution.
* Added boolean variables. They are created using Model#bool_var and
Model#bool_var_array .
* Added two options to constraints: propagation strength and reification
variable.
* Linear and simple relation constraints can now also be specified using
#equal, #equal_to, #greater, #greater_than,... in addition to comparison
operators.
* Added distinct with offsets.
* Simple relation constraints can now be used to specify relations
between two variables.
* Added basic boolean domain constraints along with conjunction and
disjunction.
* Added syntactic sugar for combining reifiable constraints with | and &.

-- 
Andreas Launila