Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Revert "training: day 3" - This wasn't ment to be committed (should h…
…ave been under DNC - Do Not Commit) This reverts commit f585125.
- Loading branch information
Showing
10 changed files
with
227 additions
and
24 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
88 changes: 88 additions & 0 deletions
88
...er-examples/src/main/java/org/optaplanner/examples/nqueens/solver/move/RowChangeMove.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,88 @@ | ||
| /* | ||
| * Copyright 2010 JBoss Inc | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| package org.optaplanner.examples.nqueens.solver.move; | ||
|
|
||
| import java.util.Collection; | ||
| import java.util.Collections; | ||
|
|
||
| import org.apache.commons.lang3.ObjectUtils; | ||
| import org.apache.commons.lang3.builder.EqualsBuilder; | ||
| import org.apache.commons.lang3.builder.HashCodeBuilder; | ||
| import org.optaplanner.core.impl.heuristic.move.AbstractMove; | ||
| import org.optaplanner.core.impl.heuristic.move.Move; | ||
| import org.optaplanner.core.impl.score.director.ScoreDirector; | ||
| import org.optaplanner.examples.nqueens.domain.Queen; | ||
| import org.optaplanner.examples.nqueens.domain.Row; | ||
|
|
||
| public class RowChangeMove extends AbstractMove { | ||
|
|
||
| private Queen queen; | ||
| private Row toRow; | ||
|
|
||
| public RowChangeMove(Queen queen, Row toRow) { | ||
| this.queen = queen; | ||
| this.toRow = toRow; | ||
| } | ||
|
|
||
| public boolean isMoveDoable(ScoreDirector scoreDirector) { | ||
| return !ObjectUtils.equals(queen.getRow(), toRow); | ||
| } | ||
|
|
||
| public Move createUndoMove(ScoreDirector scoreDirector) { | ||
| return new RowChangeMove(queen, queen.getRow()); | ||
| } | ||
|
|
||
| public void doMove(ScoreDirector scoreDirector) { | ||
| scoreDirector.beforeVariableChanged(queen, "row"); // before changes are made | ||
| queen.setRow(toRow); | ||
| scoreDirector.afterVariableChanged(queen, "row"); // after changes are made | ||
| } | ||
|
|
||
| public Collection<? extends Object> getPlanningEntities() { | ||
| return Collections.singletonList(queen); | ||
| } | ||
|
|
||
| public Collection<? extends Object> getPlanningValues() { | ||
| return Collections.singletonList(toRow); | ||
| } | ||
|
|
||
| public boolean equals(Object o) { | ||
| if (this == o) { | ||
| return true; | ||
| } else if (o instanceof RowChangeMove) { | ||
| RowChangeMove other = (RowChangeMove) o; | ||
| return new EqualsBuilder() | ||
| .append(queen, other.queen) | ||
| .append(toRow, other.toRow) | ||
| .isEquals(); | ||
| } else { | ||
| return false; | ||
| } | ||
| } | ||
|
|
||
| public int hashCode() { | ||
| return new HashCodeBuilder() | ||
| .append(queen) | ||
| .append(toRow) | ||
| .toHashCode(); | ||
| } | ||
|
|
||
| public String toString() { | ||
| return queen + " {" + queen.getRow() + " -> " + toRow + "}"; | ||
| } | ||
|
|
||
| } |
41 changes: 41 additions & 0 deletions
41
.../main/java/org/optaplanner/examples/nqueens/solver/move/factory/RowChangeMoveFactory.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,41 @@ | ||
| /* | ||
| * Copyright 2010 JBoss Inc | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| package org.optaplanner.examples.nqueens.solver.move.factory; | ||
|
|
||
| import java.util.ArrayList; | ||
| import java.util.List; | ||
|
|
||
| import org.optaplanner.core.impl.heuristic.move.Move; | ||
| import org.optaplanner.core.impl.heuristic.selector.move.factory.MoveListFactory; | ||
| import org.optaplanner.examples.nqueens.domain.NQueens; | ||
| import org.optaplanner.examples.nqueens.domain.Queen; | ||
| import org.optaplanner.examples.nqueens.domain.Row; | ||
| import org.optaplanner.examples.nqueens.solver.move.RowChangeMove; | ||
|
|
||
| public class RowChangeMoveFactory implements MoveListFactory<NQueens> { | ||
|
|
||
| public List<Move> createMoveList(NQueens nQueens) { | ||
| List<Move> moveList = new ArrayList<Move>(); | ||
| for (Queen queen : nQueens.getQueenList()) { | ||
| for (Row toRow : nQueens.getRowList()) { | ||
| moveList.add(new RowChangeMove(queen, toRow)); | ||
| } | ||
| } | ||
| return moveList; | ||
| } | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
82 changes: 82 additions & 0 deletions
82
...in/java/org/optaplanner/examples/nqueens/solver/solution/CheatingNQueensPhaseCommand.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| /* | ||
| * Copyright 2014 JBoss Inc | ||
| * | ||
| * Licensed under the Apache License, Version 2.0 (the "License"); | ||
| * you may not use this file except in compliance with the License. | ||
| * You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| package org.optaplanner.examples.nqueens.solver.solution; | ||
|
|
||
| import java.util.List; | ||
|
|
||
| import org.optaplanner.core.impl.phase.custom.CustomPhaseCommand; | ||
| import org.optaplanner.core.impl.score.director.ScoreDirector; | ||
| import org.optaplanner.examples.nqueens.domain.NQueens; | ||
| import org.optaplanner.examples.nqueens.domain.Queen; | ||
| import org.optaplanner.examples.nqueens.domain.Row; | ||
| import org.slf4j.Logger; | ||
| import org.slf4j.LoggerFactory; | ||
|
|
||
| /** | ||
| * Because N Queens is not NP-complete or NP-hard, it can be cheated. | ||
| * For this reason, N queens should not be used for benchmarking purposes. | ||
| * <p/> | ||
| * This class solves any N Queens instance using a polynomial time algorithm | ||
| * (<a href="http://en.wikipedia.org/wiki/Eight_queens_puzzle#Explicit_solutions">>explicit solutions algorithm</a>). | ||
| */ | ||
| public class CheatingNQueensPhaseCommand implements CustomPhaseCommand { | ||
|
|
||
| protected final transient Logger logger = LoggerFactory.getLogger(getClass()); | ||
|
|
||
| public void changeWorkingSolution(ScoreDirector scoreDirector) { | ||
| NQueens nQueens = (NQueens) scoreDirector.getWorkingSolution(); | ||
| int n = nQueens.getN(); | ||
| List<Queen> queenList = nQueens.getQueenList(); | ||
| List<Row> rowList = nQueens.getRowList(); | ||
|
|
||
| if (n % 2 == 1) { | ||
| Queen a = queenList.get(n - 1); | ||
| scoreDirector.beforeVariableChanged(a, "row"); | ||
| a.setRow(rowList.get(n - 1)); | ||
| scoreDirector.afterVariableChanged(a, "row"); | ||
| n--; | ||
| } | ||
| int halfN = n / 2; | ||
| if (n % 6 != 2) { | ||
| for (int i = 0; i < halfN; i++) { | ||
| Queen a = queenList.get(i); | ||
| scoreDirector.beforeVariableChanged(a, "row"); | ||
| a.setRow(rowList.get((2 * i) + 1)); | ||
| scoreDirector.afterVariableChanged(a, "row"); | ||
|
|
||
| Queen b = queenList.get(halfN + i); | ||
| scoreDirector.beforeVariableChanged(b, "row"); | ||
| b.setRow(rowList.get(2 * i)); | ||
| scoreDirector.afterVariableChanged(b, "row"); | ||
| } | ||
| } else { | ||
| for (int i = 0; i < halfN; i++) { | ||
| Queen a = queenList.get(i); | ||
| scoreDirector.beforeVariableChanged(a, "row"); | ||
| a.setRow(rowList.get((halfN + (2 * i) - 1) % n)); | ||
| scoreDirector.afterVariableChanged(a, "row"); | ||
|
|
||
| Queen b = queenList.get(n - i - 1); | ||
| scoreDirector.beforeVariableChanged(b, "row"); | ||
| b.setRow(rowList.get(n - 1 - ((halfN + (2 * i) - 1) % n))); | ||
| scoreDirector.afterVariableChanged(b, "row"); | ||
| } | ||
| } | ||
|
|
||
| } | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters