/* Author: LukArToDo Created: 05.feb 2020 Description: solution to the task -> https://www.sololearn.com/post/234352/?ref=app */ import java.util.*; public class NineMensMorris { static int WHITE=1, EMPTY_FIELD=-3, low, high; static int [][] board ; static Stack>> doubleMills ; static Map> mills, two, validPos = Map.of( 0,List.of(0,3,6), 1,List.of(1,3,5), 2,List.of(2,3,4), 3,List.of(0,1,2), 13,List.of(4,5,6), 14,List.of(2,3,4), 15,List.of(1,3,5), 16,List.of(0,3,6)); NineMensMorris (){ board = new int [7][7]; mills = new HashMap>(); two = new HashMap>(); doubleMills = new Stack>>(); low=0; high=0; } static boolean doubleMillsFound(int pieces) { playGame(pieces); mills.forEach((k,v)-> { if(v.equals(validPos.get(3))|| v.equals(validPos.get(13))){ low = k<20? 0 : 20; high = k<20 ? 16 : 36; } else { low= k<13?0:k<23?20:23; high= k<13?13:k<23?23:36; } two.forEach((tk,tv)-> { if(tk>=low&&tk l : validPos.values()) { if(count==4) break; if(!l.containsAll(v)&&l.containsAll(tv)) { if((l.equals(validPos.get(0))&&v.equals(validPos.get(2))) || (v.equals(validPos.get(0))&& l.equals(validPos.get(2)))) continue; count++; int N=minus(l,tv); if(N==-1) continue; if(v.contains(N)&&((tk<20&&!isVisit(tk%10,N))||(tk>=20&&!isVisit(N,tk%10)))) { doubleMills.push(new HashMap<>(Map.of(tk,List.of(N)))); doubleMills.push(new HashMap<>(Map.of(k,v))); break; } } } } }); }); return doubleMills.size()>0; } static void playGame(int pieces) { new NineMensMorris(); createBoard(); fillWhiteRandomly(pieces); analyzeGame(); } static void createBoard() { for(int i=0;i<7;i++) Arrays.fill(board[i], -2); for(int row : validPos.keySet()) for(int pos : validPos.get(row)) board[row%10][pos]++; board[3][3]=EMPTY_FIELD; } static void fillWhiteRandomly(int pieces) { int count=0; while(count mill_I=new ArrayList(); List mill_J=new ArrayList(); for(int j:validPos.get(i)) { if(isVisit(i%10,j)) mill_I.add(j); if(isVisit(j,i%10)) mill_J.add(j); } if(mill_I.size()==3) mills.put(i, mill_I); if(mill_J.size()==3) mills.put(i+20, mill_J); if(mill_I.size()==2) two.put(i, mill_I); if(mill_J.size()==2) two.put(i+20, mill_J); } } static boolean isVisit(int i, int j){ return board[i][j]>=0; } static int minus(List l, List sub) { return l.stream().filter(e->!sub.contains(e)).findFirst().orElse(-1); } static void displayBoard() { System.out.println("r\\c 0 1 2 3 4 5 6"); for(int i=0;i<7;i++) { System.out.printf("%-3d",i); for(int j=0;j<7;j++){ int b=board[i][j]; System.out.printf("%2s", b>=0?"O":b==EMPTY_FIELD?"X":b==-1?".":" "); } System.out.println(); } } static void displayResult(int countGame){ displayBoard(); System.out.printf("\nAfter %d attempt(s), we have:\n", countGame); if(mills.size()==0) System.out.println("No mill!\n\n"); else{ System.out.println("\nTotal mills: "+ mills.size()); mills.forEach((k,v)-> System.out.printf("%s[%d] : %s-positions%s\n",k<20?"row":"col",k%10,k<20?"col":"row",v)); if(doubleMills.size()==0) System.out.println("\nNo double mill call.\n\n"); else{ System.out.println("\nDouble mill calls: "+ doubleMills.size()/2); int line=0; while(!doubleMills.isEmpty()) { Map> map = doubleMills.pop(); map.forEach((k,v)-> System.out.printf("%s[%d]%s%s ",k<20?"row":"col",k%10,k<20?"col":"row",v)); System.out.print(line%2==0?"move to position ":"\n"); line++; } System.out.println(); } } } public static void main(String[] args) { int numberOfWhitePieces = 9; int countGame=1; while(!doubleMillsFound(numberOfWhitePieces)) { if(countGame<3) displayResult(countGame); countGame++; } if(countGame>2) { System.out.println ("\nWait........wait.....\n"); displayResult(countGame); } } }

Nine Men's Morris - find double mill