akimboyko

Toy Problem: Missionaries and Cannibals

Description

On one bank of a river are three missionaries (black triangles) and three cannibals (red circles). There is one boat available that can hold up to two people and that they would like to use to cross the river. If the cannibals ever outnumber the missionaries on either of the river’s banks, the missionaries will get eaten. How can the boat be used to safely carry all the missionaries and cannibals across the river?

Task

Try to implement the general search algorithm just described. You can use LIFO and FIFO as queuing strategies to determine the order in which nodes are explored. These two strategies are known as depth-first and breadth-first search respectively. Be careful, depth-first search may descend down infinite branches, so best implement a depth cut-off. Then, extend your implementation with a hash table that stores all the nodes found so far. Print out a trace of the states the algorithm finds (in the order they are discovered) and see ho

akimboyko

#r @"Humanizer.dll"

open Humanizer

[1 .. 1000] |> 
    Seq.map (fun n -> Humanizer.NumberToWordsExtension.ToWords(n)) |>
    Seq.collect(fun writtenOutInWords -> writtenOutInWords.ToCharArray()) |>
    Seq.where(fun ch -> ch <> ' ') |> 
    Seq.where(fun ch -> ch <> '-') |> 
    Seq.length

akimboyko

namespace Terminal

open System
open System.Collections.Immutable

[<Measure>] type USD
[<Measure>] type Volume
[<Measure>] type Percent

type Price =

akimboyko

Using ParStream

• Real: 00:00:32.700, CPU: 00:02:01.165, GC gen0: 285, gen1: 80, gen2: 5
• Real: 00:00:31.421, CPU: 00:01:59.621, GC gen0: 234, gen1: 65, gen2: 4
• Real: 00:00:32.865, CPU: 00:02:02.335, GC gen0: 250, gen1: 70, gen2: 5
• Average 32328.7ms

Using PSeq

• Real: 00:00:34.108, CPU: 00:02:06.470, GC gen0: 203, gen1: 58, gen2: 5
• Real: 00:00:33.386, CPU: 00:02:06.392, GC gen0: 224, gen1: 63, gen2: 5
• Real: 00:00:33.720, CPU: 00:02:07.764, GC gen0: 218, gen1: 63, gen2: 5

akimboyko

let (|SpaceKey|) (keyboard:KeyboardInput) = 
    keyboard.KeyPressed(Key.Space)

let (|Hold100ms|) (keyboard:KeyboardInput) = 
    keyboard.KeyPressedFor(Key.I, 100)  

match DualityApp.Keyboard with        
| SpaceKey true & Hold100ms false -> playerGo Jump
| SpaceKey true & Hold100ms true -> playerGo DoubleJump

akimboyko

// Decompiled with JetBrains decompiler
// Type: FSharpParts.FSharpParts
// Assembly: FSharpParts, Version=0.0.0.0, Culture=neutral, PublicKeyToken=null
// MVID: 54894392-FF35-398D-A745-038392438954
// Assembly location: D:\temp\SharpExperiments\FSharpParts\bin\Debug\FSharpParts.dll

using CSharpParts;
using Microsoft.FSharp.Core;

namespace FSharpParts

akimboyko

F# tricks

• Use 64-bit configuration. At Visual Studio switch 'Tools/Options/F# tools/F# Interactive/64-bit F# Interactive' should be "true"
• Tune Fsi.exe and FsiAnyCPU.exe configuration in “c:\Program Files (x86)\Microsoft SDKs\F#<version>\Framework<version>\” ** — specifies whether the common language runtime runs server garbage collection. ** — specifies whether the common language runtime runs garbage collection on a separate thread. ** — on 64-bit platforms, enables arrays that are greater than 2 gigabytes (GB) in total size.

akimboyko

# How to build
# docker build -t textretrieval-001 .
# #run and name it
# docker run --name meta -i -t textretrieval-001
# #run and mount directory
# docker run -it -v /mnt/programming:/mnt/programming textretrieval-001:latest

FROM ubuntu:latest

MAINTAINER Akim Boyko "akim dot boyko at gmail.com" version: 0.1

akimboyko

void Main()
{
	var kernel = new Ninject.StandardKernel(new EntitieseModule(), new DocumentStoreModule(), new ModelRepositoryModule());
}

public interface IModelRepository<T> where T: IModel
{
    //interface stuff here
}

akimboyko

void Main()
{
	using(var kernel = new StandardKernel(new ExampleKernel()))
	{
		var d6 = kernel.Get<Die>();
		var d20 = kernel.Get<Die>(new ConstructorArgument("numSides", 20));
		
		d6.NumSides.Dump();
		d20.NumSides.Dump();
	}