trackler 2.0.8.15 → 2.0.8.16

data/tracks/csharp/exercises/Exercises.Refactoring.sln

@@ -0,0 +1,61 @@
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio 15
+VisualStudioVersion = 15.0.26228.4
+MinimumVisualStudioVersion = 15.0.26124.0
+Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "TreeBuilding", "tree-building\TreeBuilding.csproj", "{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}"
+EndProject
+Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "Ledger", "ledger\Ledger.csproj", "{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}"
+EndProject
+Project("{9A19103F-16F7-4668-BE54-9A1E7A4F7556}") = "Markdown", "markdown\Markdown.csproj", "{78C54755-0602-409D-8058-0AC3C339BF37}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Any CPU = Debug|Any CPU
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Release|Any CPU = Release|Any CPU
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|x64.ActiveCfg = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|x64.Build.0 = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|x86.ActiveCfg = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Debug|x86.Build.0 = Debug|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|Any CPU.Build.0 = Release|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|x64.ActiveCfg = Release|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|x64.Build.0 = Release|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|x86.ActiveCfg = Release|Any CPU
+		{B0E08B2C-51F8-4E11-9D7C-02F08EAFEAD1}.Release|x86.Build.0 = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|x64.ActiveCfg = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|x64.Build.0 = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|x86.ActiveCfg = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Debug|x86.Build.0 = Debug|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|Any CPU.Build.0 = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|x64.ActiveCfg = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|x64.Build.0 = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|x86.ActiveCfg = Release|Any CPU
+		{4CD21D4F-5DCC-4506-8BDB-292555F43E9B}.Release|x86.Build.0 = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|Any CPU.ActiveCfg = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|Any CPU.Build.0 = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|x64.ActiveCfg = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|x64.Build.0 = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|x86.ActiveCfg = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Debug|x86.Build.0 = Debug|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|Any CPU.ActiveCfg = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|Any CPU.Build.0 = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|x64.ActiveCfg = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|x64.Build.0 = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|x86.ActiveCfg = Release|Any CPU
+		{78C54755-0602-409D-8058-0AC3C339BF37}.Release|x86.Build.0 = Release|Any CPU
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal

data/tracks/csharp/exercises/acronym/AcronymTest.cs

@@ -3,20 +3,44 @@ using Xunit;
 public class AcronymTest
 {
     [Fact]
-    public void Empty_string_abbreviated_to_empty_string()
+    public void Basic()
     {
-        Assert.Equal(string.Empty, Acronym.Abbreviate(string.Empty));
+        Assert.Equal("PNG", Acronym.Abbreviate("Portable Network Graphics"));
     }
 
-    [Theory(Skip = "Remove to run test")]
-    [InlineData("Portable Network Graphics", "PNG")]
-    [InlineData("Ruby on Rails", "ROR")]
-    [InlineData("HyperText Markup Language", "HTML")]
-    [InlineData("First In, First Out", "FIFO")]
-    [InlineData("PHP: Hypertext Preprocessor", "PHP")]
-    [InlineData("Complementary metal-oxide semiconductor", "CMOS")]
-    public void Phrase_abbreviated_to_acronym(string phrase, string expected)
+    [Fact(Skip = "Remove to run test")]
+    public void Lowercase_words()
     {
-        Assert.Equal(expected, Acronym.Abbreviate(phrase));
+        Assert.Equal("ROR", Acronym.Abbreviate("Ruby on Rails"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Camelcase()
+    {
+        Assert.Equal("HTML", Acronym.Abbreviate("HyperText Markup Language"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Punctuation()
+    {
+        Assert.Equal("FIFO", Acronym.Abbreviate("First In, First Out"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void All_caps_words()
+    {
+        Assert.Equal("PHP", Acronym.Abbreviate("PHP: Hypertext Preprocessor"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void NonAcronymAllCapsWord()
+    {
+        Assert.Equal("GIMP", Acronym.Abbreviate("GNU Image Manipulation Program"));
+    }
+
+    [Fact(Skip = "Remove to run test")]
+    public void Hyphenated()
+    {
+        Assert.Equal("CMOS", Acronym.Abbreviate("Complementary metal-oxide semiconductor"));
     }
 }

data/tracks/csharp/exercises/parallel-letter-frequency/ParallelLetterFrequencyTest.cs

@@ -2,7 +2,7 @@
 using System.Linq;
 using Xunit;
 
-public class ParallelLetterParallelLetterFrequency
+public class ParallelLetterFrequencyTest
 {
     // Poem by Friedrich Schiller. The corresponding music is the European Anthem.
     private const string OdeAnDieFreude =
@@ -118,4 +118,4 @@ public class ParallelLetterParallelLetterFrequency
         Assert.Equal(56, actual['t']);
         Assert.Equal(2, actual['ü']);
     }
-}
+}

data/tracks/delphi/docs/TESTS.md

@@ -1,8 +1,8 @@
 ## Running The Tests
 
-Exercises that have been fetched using the Exercism.io client are delivered with a minimum of three files: a `readme.md` file, a `.dpr` file, and a `.pas` file.  The `.dpr` file is the Delphi project file and the `.pas` file is the test runner.  Load the Delphi project by either double clicking on the `.dpr` file or by opening the project from with in Delphi.  You will be responsible for creating a new `.pas` file that will contain your solution code that the tests will be run against.  Refer to the `readme.md` file for instruction on how to compiles and execute your code.
+Exercises that have been fetched using the Exercism.io [command line client](http://www.exercism.io/cli) are delivered with a minimum of three files: a `readme.md` file, a `.dpr` file, and a `.pas` file.  The `.dpr` file is the Delphi project file and the `.pas` file is the test runner.  Load the Delphi project by either double clicking on the `.dpr` file or by opening the project from with in Delphi.  You will be responsible for creating a new `.pas` file that will contain your solution code that the tests will be run against.  Refer to the `readme.md` file for instruction on how to compile and execute your code.
 
-All tests have been ignored except the first one for you to work on. To continue, just comment the ```[Ignore]``` attribute on the test to start working on it.
+All tests have been ignored except the first one for you to work on. To continue, just comment the `[Ignore]` attribute on the test to start working on it.
 
 Make sure [DUnitX](https://github.com/VSoftTechnologies/DUnitX) is installed, if not already installed from the setup above.
 

data/tracks/elixir/exercises/bowling/bowling.exs

@@ -10,7 +10,7 @@ defmodule Bowling do
   end
 
   @doc """
-    Records the number of pins knocked down on a single roll. Returns `:ok`
+    Records the number of pins knocked down on a single roll. Returns `any`
     unless there is something wrong with the given number of pins, in which
     case it returns a helpful message.
   """

data/tracks/fsharp/docs/LEARNING.md

@@ -6,8 +6,9 @@
 * The [F# Foundation](http://fsharp.org/) is a non-profit organisation which aim is to promote F#. The website has lots of links to great F# content. Perhaps even more interesting is their [mentorship program](http://fsharp.org/mentorship/index.html), where you can apply to learn F# from an experienced F# mentor.
 
 ### Videos
-* [F# for the Practical Developer](https://www.youtube.com/watch?v=7z_q06HQLes&t=2070s) is a nice introduction to F#.
+* [F# for the Practical Developer](https://www.youtube.com/watch?v=7z_q06HQLes) is a nice introduction to F#.
 * [F# - Why you should give an F](https://www.youtube.com/watch?v=kKkFabSzZvU) has Daniel Chambers give a sweet introduction into F#, neatly highlighting most F#'s features.
+* In [A tour of F#](https://www.youtube.com/watch?v=15tK48Xes0k), Phillip Carter gives a great introduction to the F# language.
 * [Dr. Don Syme - Introduction to F#](https://channel9.msdn.com/Series/C9-Lectures-Dr-Don-Syme-Introduction-to-F-/C9-Lectures-Dr-Don-Syme-Introduction-to-F-1-of-3) has Don Syme, the designer of F#, give an introduction to F#.
 * If you're a C# developer, you might like [F# for C# developers](https://vimeo.com/78908217) by Phil Trelford.
 * [PluralSight](https://www.pluralsight.com/) has several [great](https://www.pluralsight.com/courses/fsintro) [introduction](https://www.pluralsight.com/courses/fsharp-jumpstart) [courses](https://www.pluralsight.com/courses/fsharp-fundamentals). The downside: PluralSight is a paid service, but you can request a [free trial](https://www.pluralsight.com/pricing).

data/tracks/go/config.json

@@ -4,7 +4,6 @@
   "repository": "https://github.com/exercism/xgo",
   "active": true,
   "deprecated": [
-    "accumulate",
     "binary",
     "bottles",
     "counter",
@@ -80,6 +79,13 @@
         "Filtering"
       ]
     },
+    {
+      "difficulty": 1,
+      "slug": "accumulate",
+      "topics": [
+        "Lists"
+      ]
+    },
     {
       "difficulty": 3,
       "slug": "acronym",

data/tracks/go/exercises/prime-factors/{primefactors_test.go → prime_factors_test.go}

@@ -26,10 +26,13 @@ var tests = []struct {
 	{93819012551, []int64{11, 9539, 894119}},
 }
 
-func TestPrimeFactors(t *testing.T) {
+func TestTestVersion(t *testing.T) {
 	if testVersion != targetTestVersion {
 		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
 	}
+}
+
+func TestPrimeFactors(t *testing.T) {
 	for _, test := range tests {
 		actual := Factors(test.input)
 		if !reflect.DeepEqual(actual, test.expected) {

data/tracks/go/exercises/protein-translation/protein_translation_test.go

@@ -44,6 +44,12 @@ var proteinTestCases = []rnaCase{
 	{"UGGUGUUAUUAAUGGUUU", []string{"Tryptophan", "Cysteine", "Tyrosine"}},
 }
 
+func TestTestVersion(t *testing.T) {
+	if testVersion != targetTestVersion {
+		t.Fatalf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
+	}
+}
+
 func TestCodon(t *testing.T) {
 	for _, test := range codonTestCases {
 		actual := FromCodon(test.input)
@@ -61,9 +67,3 @@ func TestProtein(t *testing.T) {
 		}
 	}
 }
-
-func TestTestVersion(t *testing.T) {
-	if testVersion != targetTestVersion {
-		t.Errorf("Found testVersion = %v, want %v.", testVersion, targetTestVersion)
-	}
-}

data/tracks/go/exercises/pythagorean-triplet/example.go

@@ -1,5 +1,7 @@
 package pythagorean
 
+const testVersion = 1
+
 type Triplet [3]int
 
 func pyth(a, b, c int) bool {

data/tracks/go/exercises/pythagorean-triplet/pythagorean_triplet_test.go

@@ -24,6 +24,14 @@ import (
 	"testing"
 )
 
+const targetTestVersion = 1
+
+func TestTestVersion(t *testing.T) {
+	if testVersion != targetTestVersion {
+		t.Fatalf("Found testVersion = %v, want %v", testVersion, targetTestVersion)
+	}
+}
+
 var rangeTests = []struct {
 	min, max int
 	ts       []Triplet

data/tracks/julia/README.md

@@ -1,4 +1,6 @@
 # Exercism Julia Track
+
+[![Join the chat at https://gitter.im/exercism/xjulia](https://badges.gitter.im/exercism/xjulia.svg)](https://gitter.im/exercism/xjulia?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 [![Build Status](https://travis-ci.org/exercism/xjulia.svg?branch=master)](https://travis-ci.org/exercism/xjulia)
 
 Exercism exercises in Julia.

data/tracks/julia/config.json

@@ -215,6 +215,15 @@
         "mathematics"
       ]
     },
+    {
+      "slug": "rotational-cipher",
+      "difficulty": 2,
+      "topics": [
+        "string literals",
+        "metaprogramming",
+        "strings"
+      ]
+    },
     {
       "slug": "custom-set",
       "difficulty": 5,

data/tracks/julia/exercises/rotational-cipher/HINTS.md

@@ -0,0 +1,21 @@
+This is a good exercise to experiment with non-standard string literals and metaprogramming.
+
+A short introduction to non-standard string literals can be found in this [blog post](http://iaindunning.com/blog/julia-unicode.html). A detailed metaprogramming guide can be found in the [manual](http://docs.julialang.org/en/stable/manual/metaprogramming/).
+
+You can extend your solution by adding the functionality described below. To test your solution, you have to remove the comments at the end of `runtests.jl` before running the tests as usual.
+
+Bonus A only requires basics as outlined in the blog post. Bonus B requires significantly more knowledge of metaprogramming in Julia.
+
+## Bonus A
+Implement a string literal that acts as `ROT13` on the string:
+```julia
+R13"abcdefghijklmnopqrstuvwxyz" == "nopqrstuvwxyzabcdefghijklm"
+```
+
+## Bonus B
+Implement string literals `R<i>`, `i = 0, ..., 26`, that shift the string for `i` values:
+```julia
+R0"Hello, World!" == "Hello, World!"
+R4"Testing 1 2 3 testing" == "Xiwxmrk 1 2 3 xiwxmrk"
+R13"abcdefghijklmnopqrstuvwxyz" == "nopqrstuvwxyzabcdefghijklm"
+```

data/tracks/julia/exercises/rotational-cipher/example.jl

@@ -0,0 +1,16 @@
+function rotate(n::Int, c::Char)
+    if c in 'a':'z'
+        c = 'a' + (c - 'a' + n) % 26
+    elseif c in 'A':'Z'
+        c = 'A' + (c - 'A' + n) % 26
+    end
+    return c
+end
+
+rotate(n::Int, s::String) = join(rotate(n, c) for c in s)
+
+for n in 0:26
+    eval( :(macro $(Symbol(:R, n, :_str))(s::String)
+        :(rotate($$n, $s))
+    end))
+end

data/tracks/julia/exercises/rotational-cipher/runtests.jl

@@ -0,0 +1,51 @@
+using Base.Test
+
+include("rotational-cipher.jl")
+
+@testset "rotate function" begin
+    @testset "rotate by n" begin
+        @testset "no wrap" begin
+            @test rotate(1, "a") == "b"
+            @test rotate(1, 'a') == 'b'
+            @test rotate(13, "m") == "z"
+            @test rotate(13, 'm') == 'z'
+        end
+        @testset "wrap around" begin
+            @test rotate(13, "n") == "a"
+            @test rotate(13, 'n') == 'a'
+        end
+    end
+
+    @testset "full rotation" begin
+        @test rotate(26, "a") == "a"
+        @test rotate(26, 'a') == 'a'
+        @test rotate(0, "a") == "a"
+        @test rotate(0, 'a') == 'a'
+    end
+
+    @testset "full strings" begin
+        @test rotate(5, "OMG") == "TRL"
+        @test rotate(5, "O M G") == "T R L"
+        @test rotate(4, "Testing 1 2 3 testing") == "Xiwxmrk 1 2 3 xiwxmrk"
+        @test rotate(21, "Let's eat, Grandma!") == "Gzo'n zvo, Bmviyhv!"
+        @test rotate(13, "The quick brown fox jumps over the lazy dog.") == "Gur dhvpx oebja sbk whzcf bire gur ynml qbt."
+    end
+end
+
+# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #
+# Additional exercises                                                #
+# Remove the comments for the optional bonus exercises from HINTS.md  #
+# # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # #
+
+# Bonus A
+# @testset "string literal R13" begin
+#     @test R13"The quick brown fox jumps over the lazy dog." == "Gur dhvpx oebja sbk whzcf bire gur ynml qbt."
+# end
+
+# Bonus B
+# @testset "string literals" begin
+#     @test R5"OMG" == "TRL"
+#     @test R4"Testing 1 2 3 testing" == "Xiwxmrk 1 2 3 xiwxmrk"
+#     @test R21"Let's eat, Grandma!" == "Gzo'n zvo, Bmviyhv!"
+#     @test R13"The quick brown fox jumps over the lazy dog." == "Gur dhvpx oebja sbk whzcf bire gur ynml qbt."
+# end

data/tracks/ocaml/config.json

@@ -161,6 +161,11 @@
       "difficulty": 8,
       "topics": []
     },
+    {
+      "slug": "connect",
+      "difficulty": 8,
+      "topics": ["Search"]
+    },
     {
       "slug": "meetup",
       "difficulty": 9,

data/tracks/ocaml/exercises/connect/.merlin

@@ -0,0 +1,3 @@
+S *
+B _build/**
+PKG core oUnit

data/tracks/ocaml/exercises/connect/Makefile

@@ -0,0 +1,15 @@
+test: test.native
+	@./test.native
+
+test.native: *.ml *.mli
+	@corebuild -r -quiet -pkg oUnit test.native
+
+main.byte: clean
+	@corebuild -r -quiet main.byte
+
+clean:
+	rm -rf _build
+	rm -f test.native
+	rm -f main.byte
+
+.PHONY: clean

data/tracks/ocaml/exercises/connect/connect.mli

@@ -0,0 +1,4 @@
+type player = O | X
+
+(* Returns the winning player inside the option if there is a winner, otherwise None *)
+val connect : string list -> player option

data/tracks/ocaml/exercises/connect/example.ml

@@ -0,0 +1,80 @@
+open Core.Std
+
+type player = O | X
+type cell = O | X | Empty
+
+module IntTuple = struct
+  type t = int * int
+
+  let compare (x0, y0) (x1, y1) =
+    match Int.compare x0 x1 with
+      0 -> Int.compare y0 y1
+    | c -> c
+ 
+  let t_of_sexp tuple = Tuple2.t_of_sexp Int.t_of_sexp Int.t_of_sexp tuple
+  let sexp_of_t tuple = Tuple2.sexp_of_t Int.sexp_of_t Int.sexp_of_t tuple
+end
+
+module IntIntSet = Set.Make(IntTuple)
+
+let (>|>) f g = Fn.compose g f
+
+let to_matrix (b: string list): cell array array =  
+  let to_cell = function
+  | 'X' -> Some X
+  | 'O' -> Some O
+  | '.'  -> Some Empty
+  | _ -> None in
+  List.map b ~f:(String.to_list >|> List.filter_map ~f:to_cell >|> Array.of_list) |> Array.of_list
+
+let neighbouring_positions rows cols (r, c): (int * int) list = 
+  let deltas = [
+          -1,0; -1,1;
+     0,-1;       0,1;
+     1,-1; 1,0;
+  ] in
+  List.filter_map deltas ~f:(fun (dr, dc) -> 
+    if r + dr < 0 || r + dr >= rows || c + dc < 0 || c + dc >= cols 
+    then None 
+    else Some (r+dr, c+dc)
+  )
+
+let neighbours board rows cols (r,c) =
+  let cell = board.(r).(c) in
+  let positions = neighbouring_positions rows cols (r,c) in
+  List.filter positions ~f:(fun (r1,c1) -> cell = board.(r1).(c1))
+
+let search successors initial ~matches = 
+  let rec go visited node = 
+    if matches node then (true, visited)
+    else 
+    if not (Set.mem visited node) then
+      begin
+        let visited = Set.add visited node in
+        let successor_nodes = successors node in
+        if List.is_empty successor_nodes 
+        then (false, visited)
+        else 
+          List.fold_left successor_nodes 
+            ~f:(fun (fnd, v) n -> if fnd then (true, v) else go v n) 
+            ~init:(false, visited)
+      end
+    else (false, visited)
+  in
+  Array.exists initial ~f:(go (IntIntSet.empty) >|> fst)
+
+let connect board: player option = 
+  let board = to_matrix board in
+  let rows = Array.length board in
+  let cols = Array.length board.(0) in
+  let search = search (neighbours board rows cols) in
+  let initials_x = Array.filter_mapi board ~f:(fun row cell -> if cell.(0) = X then Some (row, 0) else None) in
+  if search initials_x ~matches:(fun (r,c) -> (c = cols - 1) && board.(r).(c) = X)
+  then Some X
+  else 
+  begin
+    let initials_o = Array.filter_mapi board.(0) ~f:(fun col cell -> if cell = O then Some (0, col) else None) in
+    if search initials_o ~matches:(fun (r,c) -> (r = rows - 1) && board.(r).(c) = O)
+      then Some O
+      else None 
+  end