LEAGUE OPTIMIZERS 2015th

Naslov: Re: LEAGUE OPTIMIZERS 2015th Ned 14 Jun 2015 - 20:20

Best solutions

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Ned 14 Jun 2015 - 20:30

Overall standings 2015th

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Uto 30 Jun 2015 - 22:10

The July optimization - Multimino

July 1 - 19; 8 pm CET

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Uto 30 Jun 2015 - 22:43

OBJECTIVE: Put full set of tromino, tetromino and pentomino in first grid. Use numbers and letters to mark tiles (as shown below the grid). Tiles from one set (marked with same color) can not share a side (tiles with different colors can). All tiles can be rotated, while Pentominoes also can be reflected. Grey fields are locked, and they can not be set figures and calculated as all the empty fields.

Second grid will show cell values for those occupied by tiles (3,4 and 5). After entering your name (must!) all unused cells will get value 2.

CALCULATION (3. grid): Occupied cell value is equal to sum of all adjacent cells ( 8 ) from grid 2. Unoccupied cell value is equal to doubled and negative sum of all adjacent cells ( 8 ) from grid 2. Final result is sum of all cells from grid 3. Maximize final result.

***************************************************

ZADATAK: U prvu mrežu treba ucrtati po komplet tromina, tetromina i pentomina. Figure označite odgovarajućim brojem i slovom (kao ispod mreže). Figure iste boje se smeju dodirivati samo dijagonalno, a figure različite boje mogu se dodirivati i stranicom. Sve se figure mogu rotirati, a pentomina se mogu i reflektovati. Siva polja su zaključana, i na njih ne možete postaviti figure, a obračunavaju se kao i sva prazna polja.

U drugoj mreži biće prikazane brojčane vrednosti svih polja zauzetih figurama (3, 4 ili 5), a kada ucrtate sva 3 seta figura, morate upisati svoje ime u predviđeno polje, čime će sva preostala (prazna) polja u drugoj mreži biti ispunjena brojem 2.

OBRAČUN (3. mreža): Vrednost polja zauzetih figurama, jednaka je zbiru svih susednih ćelija, dok je vrednost praznih polja jednaka dvostrukom zbiru svih susednih, i ona je negativna. Konačan rezultat predstavlja zbir svih vrednosti u 3. mreži. Maksimizujte svoj rezultat.

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Uto 30 Jun 2015 - 23:34

The appearance and manner of marking tiles

Izgled i način obeležavanja figura

LEAGUE OPTIMIZERS 2015th - Page 3 Izgled11

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Ned 19 Jul 2015 - 20:29

July 2015th

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Ned 19 Jul 2015 - 20:37

Best solutions

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Ned 19 Jul 2015 - 20:52

Overall standings 2015th

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Čet 30 Jul 2015 - 11:49

August 2015th

Alphabet

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Čet 30 Jul 2015 - 12:15

OBJECTIVE: In first grid form snake with contains all the letters of the alphabet, two of each - one uppercase and one lowercase. Letters can be entered in any order (no need to keep same letters together), but uppercase and lowercase letters must alternate. Snake can not cross itself or touch by side (diagonal touch is allowed). Value of letters is acording to position in alphabet A=1, B=2 ... Z=26. Lowercase letters are negative a=-1, b=-2... z=-26.

CALCULATION Next to and bellow second table are sums of rows and colums. Rmax and Rmin are maximal and minimal sum by row, Cmax and Cmin are maximal and minimal sum by column. Final result is ((Rmax+Rmin)*(Cmax+Cmin)). If more than one row or column have same sum that does not reflect on result. Maximize final result.

**************************************************************

ZADATAK: U prvoj tabeli formirajte zmiju koja sadrži sva slova abecede, po dva od svakog - jedno veliko i jedno malo slovo. Slova mogu biti uneta po bilo kom redosledu (ne moraju ista slova biti zajedno), ali se velika i mala slova moraju naizmenično smenjivati. Zmija sebe ne sme presecati niti dodirivati, osim dijagonalno. Vrednost slova odgovara poziciji u abecedi A=1, B=2... Z=26. Mala slova su negativna a=-1, b=-2... z=-26.

OBRAČUN: Pored i ispod druge tabele su zbirovi redova i kolona. Rmax i Rmin su maksimalna i minimalna suma po redovima, Cmax i Cmin su maksimalna i minimalna suma po kolonama. Finalni rezultat je ((Rmax+Rmin)*(Cmax+Cmin)). Ukoliko više redova ili kolona imaju istu vrednost, to ne utiče na obračun. Maksimizujte finalni rezultat.

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Čet 30 Jul 2015 - 12:17

LEAGUE OPTIMIZERS 2015th - Page 3 Alphab12

_________________
http://enigmatika.webs.com/

Ako vam se čini da je sve u redu, nešto ste sigurno propustili!

Naslov: Re: LEAGUE OPTIMIZERS 2015th Pet 31 Jul 2015 - 13:50

Hi Jovan and all optimization fans hello

Again a very nice idea happyup

In this puzzle we may see lots of different and varying solutions.
Because it has lots of possibilities Cool

Also in October 2013 we dealed a snake puzzle like
this one and that was like a little monster Smile

Also we also encountered some overmax solutions
in that one after the completion of the solving period which shows us it is hard to obtain the
best solution in these kind of tasks. Looking forward to deal with this one after the publication eating