/* * Copyright 2011 Red Hat, Inc. and/or its affiliates. * * 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.domain.solution; import org.apache.commons.lang3.builder.CompareToBuilder; import org.optaplanner.core.impl.heuristic.selector.common.decorator.SelectionSorterWeightFactory; import org.optaplanner.examples.nqueens.domain.NQueens; import org.optaplanner.examples.nqueens.domain.Row; public class RowStrengthWeightFactory implements SelectionSorterWeightFactory<NQueens, Row> { @Override public Comparable createSorterWeight(NQueens nQueens, Row row) { int distanceFromMiddle = calculateDistanceFromMiddle(nQueens.getN(), row.getIndex()); return new RowStrengthWeight(row, distanceFromMiddle); } private static int calculateDistanceFromMiddle(int n, int columnIndex) { int middle = n / 2; int distanceFromMiddle = Math.abs(columnIndex - middle); if ((n % 2 == 0) && (columnIndex < middle)) { distanceFromMiddle--; } return distanceFromMiddle; } public static class RowStrengthWeight implements Comparable<RowStrengthWeight> { private final Row row; private final int distanceFromMiddle; public RowStrengthWeight(Row row, int distanceFromMiddle) { this.row = row; this.distanceFromMiddle = distanceFromMiddle; } @Override public int compareTo(RowStrengthWeight other) { return new CompareToBuilder() // The stronger rows are on the side, so they have a higher distance to the middle .append(distanceFromMiddle, other.distanceFromMiddle) .append(row.getIndex(), other.row.getIndex()) .toComparison(); } } }