/*
 *  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 dk.ekot.eternii;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import java.util.Comparator;
import java.util.List;
import java.util.stream.Stream;

/**
 * Prioritize MOST free edges and pieces.
 *
 */
public class WalkerD implements Walker {
    private static final Logger log = LoggerFactory.getLogger(WalkerD.class);

    private final EBoard board;
    private final Comparator<EBoard.Pair<EBoard.Field, List<EBoard.Piece>>> comparator;

    public WalkerD(EBoard board) {
        this.board = board;
        comparator = getFieldComparator();
    }

    @Override
    public EBoard.Pair<EBoard.Field, List<EBoard.Piece>> get() {
        return getFreePiecesStrategyA()
                .findFirst()
                .orElse(null);
    }

    /**
     * @return the free fields with lists of corresponding Pieces. Empty if no free fields.
     */
    public Stream<EBoard.Pair<EBoard.Field, List<EBoard.Piece>>> getFreePiecesStrategyA() {
        return board.streamAllFields()
                .filter(EBoard.Field::isFree)
                .map(field -> new EBoard.Pair<>(field, field.getBestPieces()))
                .sorted(comparator);
    }

    private Comparator<EBoard.Pair<EBoard.Field, List<EBoard.Piece>>> getFieldComparator() {
        return Comparator.<EBoard.Pair<EBoard.Field, List<EBoard.Piece>>>
                        comparingInt(pair -> pair.left.getOuterEdgeCount()) // Most free edges
                .thenComparingInt(pair -> board.getWidth()*board.getHeight()-pair.right.size()) // Most valid pieces
                .thenComparingInt(pair -> pair.left.getY()*board.getWidth() + pair.left.getX());
    }


}

@@ -781,24 +781,139 @@
  pieces.%0A *%0A
+ * Does not get far at all as placing a piece in the open raises edge requirements by 4, quickly draining the bag.%0A
  */%0Apublic c

Add note on effect