Morpion solitaire/Unicon: Difference between revisions

<lang Unicon>link printf,strings,options

 

 

procedure main(A) # Morphion

MorpionConf(A)

if \M_ReplayFile then ReplayMorpion()

end

 

log,history, # move log and replayable history log

roff,coff,center, # origin expansion offsets and center

count, # game number (multi-game)

rseed) # &random at start of random play

 

return MG

end

 

every x := !M.line do { # draw the line

g := MG.grid[x[1],x[2]]

( c := 5 to *G[r := 1] ) do # down & left

ScanGridLine(G,r,c,+1,-1,DLD,MG.pool)

every put(pool1 := [], MG.pool[2|19|20|26]) # cor. o(2), i(1), val o(1)

MG.pool := pool1

return pool

end

procedure ValidMove5T(L,dir) #: Succeed if L has valid 5T move

local i,j

every (j := 0) +:= ( find(dir,(!L).direction), 1)

if j > 1 then fail # no overlap, =1 implies at an end

return # that's it!

end

G[r,c] := morpioncell(XINIT,"",r,c)

}

end

 

rn := *(G := MG.grid) # capture ...

cn := *G[1] # ... entry dimensions

if \(!G)[1].symbol then { # left edge

MG.coff +:= 1

}

return MG

end

 

procedure PrintGrid(MG) #: print the current Grid

G := MG.grid

every r := 1 to *G do {

every c := 1 to *(G[r]) do

}

return MG

end

 

if MG.move := ?ScanGrid(MG).pool then return MG

end

 

 

 

procedure MorpionConf(A) # Configure the Solver

M_CommandLine := copy(A) # preserve

os ||:= "-UN+ -SW+ -SD+ -A: -E+ -B+ -W+"

opt := options(A,os,Usage) # -<anything else> gets help

M_Strategy := case opt["A"] of {

}

M_StatUpd := (0 < \opt["UN"]) | def_un

M_BestL := (0 < \opt["B"]) | 5

M_WorstL := (0 < \opt["W"]) | 0

M_SrchWid := (0 < \opt["SW"]) | 5

c := sprintf("# --- Morpion Solitaire 5 (v%s) ---\n#\n",MORPVER)

c ||:= "# Command line options :"

every c ||:= " " || !A

c ||:= "\n# Summary of Morpion Configuration:\n"

c ||:= "# Multi-game options:\n"

c ||:= sprintf("# - Status Updates = %i\n",M_StatUpd)

c ||:= sprintf("# - Keep best = %i\n",M_BestL)

c ||:= sprintf("# - Keep worst = %i\n",M_WorstL)

c ||:= "# Replaying\n"

c ||:= sprintf("# Player Strategy = %i\n",M_Strategy)

c ||:= sprintf("# - Search Width (strategy dependant) = %i\n",M_SrchWid)

M_Config := c

if \opt["Q"] then stop(M_Config,"-Q Stops run after processing options")

end</lang>

== Multigame Simulation and Monitoring Support ==

etime := -&time

if N <= 0 then N := "unlimited"

repeat {

if *worstL > M_WorstL then pull(worstL)

}

if *bestL > M_BestL then get(bestL)

}

break fprintf(&errout,"\nExiting after %i simulations.\n",n)

}

avg +:= i * scores[i]

}

GraphScores(scores) # graph results

MemUsage() # diagnostic

end

 

procedure GraphScores(S) #: graph results

chart := []

every s := key(S) do { # by score

until chart[n] do put(chart,0) # grow chart to need

chart[n] +:= S[s]

}

every n := 1 to *chart do

end

 

procedure MemUsage() #: monitor usage

<lang Unicon>procedure ReplayMorpion() #: Handle recorded games

Replayer(M := ReadMoveLog(M_ReplayFile)) # read game and save data

if /M_ReplayAfter | (M_ReplayAfter > *M) then {

}

if M_Limit === 1 then

else

}

return

end

 

static ML,radj,cadj

xc := x.col + MG.coff

pool := []

mr := m.line[m.move,1]

mc := m.line[m.move,2]

}

end

 

 

M := []

until *b = 0 do {

b ?:= ( x.ref := integer(tab(many(&digits))),=":", # base

x.row := integer(=!["-","+",""]||tab(many(&digits))),=",",

stop(&output,"Syntax error in line above (disamiguation).")

}

put(M,x)

}

end

 

# 1. whitespace and comments (everything past #) are ignored\n_

# 2. moves may be ; or newline separated\n_

# 4. all row/col coordinates are relative to the 1,1 origin\n_

# located at the intersection of the lines containing the\n_

every m := MG.history[i := 1 to *MG.history] do {

e := m.move ~= (1|5)

l ||:= sprintf("%i:%i,%i^%i,%i;",

i,m.line[m.move,1]-m.roff,m.line[m.move,2]-m.coff,

if *l > 70 then {

c ||:= l || "\n"

}

}

end</lang>

 

{{libheader|Icon Programming Library}}

 

=== Help ===

Where options are:

-A choose player strategy approach (default=random, future)

-E Specifiy an position fitness evaluation function (default none, future)

-SW Search width (strategy dependent, future)

-SD Search depth (strategy dependent, future)

-R|-replay replay

-RF file containing game record to be replayed

-RN number of moves to replay (0=all)

-seed start the seed of the random number at this value

-L|-limit games to play (if 0 or less then play until any of 'XxQq' is pressed

note for larger n this benefits from larger BLKSIZE, STRSIZE environment variables

-UN Give status update notifications every n simulations

-B Keep best n games of unique length (default 5)

-W Keep worst n games of unique length (default 3)

 

=== Multigame ===

The multigame simulation of completely random play includes a histogram showing game scores clustering in the 20's and 60's. This result is similar to results obtained by [http://www.morpionsolitaire.com/English/RecordsGrids5T.htm Jean-Jacques Sibil] (scroll down to find reference) who has run nearly a billion such simulations achieving a high score of 102 as of 2010.

 

#

# Command line options :

# Summary of Morpion Configuration:

# Games to play = * unlimited *

# Multi-game options:

# - Status Updates = 500

# - Keep best = 5

# - Keep worst = 0

# Replaying

# Player Strategy = procedure RandomPlayer

# - Search Width (strategy dependant) = 5

# - Search Depth (strategy dependant) = 5

#

 

Shortest game was 20 moves.

 

0 | ( 0)

 

Longest (5) Game(s):

 

 

1234567890123456

1 ................

4 .....+****+.....

8 ...*++++++++*+..

1234567890123456

#

#

 

#

#

 

#

#

 

1234567890123456

1 ................

15 ..........+.....

16 ................

1234567890123456

 

Shortest (0) Game(s):

 

&regions ( - , - ,string,block) : - 0 41859440 41859440