public class BuildingBlocks extends ExampleFD
Each of four alphabet blocks has a single letter of the alphabet on each of its six sides. In all, the four blocks contain every letter but Q and Z. By arranging the blocks in various ways, you can spell all of the words listed below. Can you figure out how the letters are arranged on the four blocks?
BAKE ONYX ECHO OVAL
GIRD SMUG JUMP TORN
LUCK VINY LUSH WRAP
Constructor and Description |
---|
BuildingBlocks() |
Modifier and Type | Method and Description |
---|---|
static void |
main(String[] args)
It executes the program to solve this logic puzzle.
|
void |
model()
It specifies a standard way of modeling the problem.
|
creditSearch, getSearch, getSearchVariables, getStore, printMatrix, search, searchAllAtOnce, searchAllOptimal, searchLDS, searchMasterSlave, searchMaxRegretOptimal, searchMiddle, searchMostConstrainedStatic, searchOptimal, searchSmallestDomain, searchSmallestMedian, searchSmallestMiddle, searchSmallestMin, searchWeightedDegree, searchWithMaxRegret, searchWithRestarts, shavingSearch
Copyright © 2022. All rights reserved.