🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉
Avatar of Arshia001

Arshia001's solution

to Two Bucket in the F# Track

Published at Apr 13 2019 · 0 comments
Instructions
Test suite
Solution

Note:

This exercise has changed since this solution was written.

Given two buckets of different size, demonstrate how to measure an exact number of liters by strategically transferring liters of fluid between the buckets.

Since this mathematical problem is fairly subject to interpretation / individual approach, the tests have been written specifically to expect one overarching solution.

To help, the tests provide you with which bucket to fill first. That means, when starting with the larger bucket full, you are NOT allowed at any point to have the smaller bucket full and the larger bucket empty (aka, the opposite starting point); that would defeat the purpose of comparing both approaches!

Your program will take as input:

  • the size of bucket one
  • the size of bucket two
  • the desired number of liters to reach
  • which bucket to fill first, either bucket one or bucket two

Your program should determine:

  • the total number of "moves" it should take to reach the desired number of liters, including the first fill
  • which bucket should end up with the desired number of liters (let's say this is bucket A) - either bucket one or bucket two
  • how many liters are left in the other bucket (bucket B)

Note: any time a change is made to either or both buckets counts as one (1) move.

Example: Bucket one can hold up to 7 liters, and bucket two can hold up to 11 liters. Let's say bucket one, at a given step, is holding 7 liters, and bucket two is holding 8 liters (7,8). If you empty bucket one and make no change to bucket two, leaving you with 0 liters and 8 liters respectively (0,8), that counts as one "move". Instead, if you had poured from bucket one into bucket two until bucket two was full, leaving you with 4 liters in bucket one and 11 liters in bucket two (4,11), that would count as only one "move" as well.

To conclude, the only valid moves are:

  • pouring from one bucket to another
  • emptying one bucket and doing nothing to the other
  • filling one bucket and doing nothing to the other

Written with <3 at Fullstack Academy by Lindsay Levine.

Running the tests

To run the tests, run the command dotnet test from within the exercise directory.

Further information

For more detailed information about the F# track, including how to get help if you're having trouble, please visit the exercism.io F# language page.

Source

Water Pouring Problem http://demonstrations.wolfram.com/WaterPouringProblem/

TwoBucketTest.fs

// This file was auto-generated based on version 1.4.0 of the canonical data.

module TwoBucketTest

open FsUnit.Xunit
open Xunit

open TwoBucket

[<Fact>]
let ``Measure using bucket one of size 3 and bucket two of size 5 - start with bucket one`` () =
    let bucketOne = 3
    let bucketTwo = 5
    let goal = 1
    let startBucket = Bucket.One
    let expected = { Moves = 4; GoalBucket = Bucket.One; OtherBucket = 5 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected

[<Fact(Skip = "Remove to run test")>]
let ``Measure using bucket one of size 3 and bucket two of size 5 - start with bucket two`` () =
    let bucketOne = 3
    let bucketTwo = 5
    let goal = 1
    let startBucket = Bucket.Two
    let expected = { Moves = 8; GoalBucket = Bucket.Two; OtherBucket = 3 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected

[<Fact(Skip = "Remove to run test")>]
let ``Measure using bucket one of size 7 and bucket two of size 11 - start with bucket one`` () =
    let bucketOne = 7
    let bucketTwo = 11
    let goal = 2
    let startBucket = Bucket.One
    let expected = { Moves = 14; GoalBucket = Bucket.One; OtherBucket = 11 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected

[<Fact(Skip = "Remove to run test")>]
let ``Measure using bucket one of size 7 and bucket two of size 11 - start with bucket two`` () =
    let bucketOne = 7
    let bucketTwo = 11
    let goal = 2
    let startBucket = Bucket.Two
    let expected = { Moves = 18; GoalBucket = Bucket.Two; OtherBucket = 7 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected

[<Fact(Skip = "Remove to run test")>]
let ``Measure one step using bucket one of size 1 and bucket two of size 3 - start with bucket two`` () =
    let bucketOne = 1
    let bucketTwo = 3
    let goal = 3
    let startBucket = Bucket.Two
    let expected = { Moves = 1; GoalBucket = Bucket.Two; OtherBucket = 0 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected

[<Fact(Skip = "Remove to run test")>]
let ``Measure using bucket one of size 2 and bucket two of size 3 - start with bucket one and end with bucket two`` () =
    let bucketOne = 2
    let bucketTwo = 3
    let goal = 3
    let startBucket = Bucket.One
    let expected = { Moves = 2; GoalBucket = Bucket.Two; OtherBucket = 2 }
    measure bucketOne bucketTwo goal startBucket |> should equal expected
module TwoBucket

open System.Collections.Immutable

type Bucket = One | Two

type Result = { Moves: int; GoalBucket: Bucket; OtherBucket: int }

let nextStates (bucketOne, bucketTwo, (one, two)) =
    [
        (0, two); // empty one
        (one, 0); // empty two
        (bucketOne, two); // fill one
        (one, bucketTwo); // fill two
        (max 0 (one - bucketTwo + two), min bucketTwo (two + one)); // pour one to two
        (min bucketOne (one + two), max 0 (two - bucketOne + one)) // pour two to one
    ]

let rec traverse (bucketOne, bucketTwo, goal, seen: Set<int * int>, queue: ImmutableQueue<int * int * int>) =
    if (queue.IsEmpty) then failwith "No solution"
    let (queue, (one, two, moves)) = queue.Dequeue()
    if one = goal then { Moves = moves; GoalBucket = One; OtherBucket = two }
    elif two = goal then { Moves = moves; GoalBucket = Two; OtherBucket = one }
    else
        let seen = seen.Add (one, two)
        let newStates = 
            nextStates (bucketOne, bucketTwo, (one, two))
            |> Seq.filter (fun x -> seen.Contains(x) |> not)
            |> Seq.map (fun (one, two) -> (one, two, moves + 1))
        let queue = Seq.fold (fun (queue: ImmutableQueue<_>) x -> queue.Enqueue(x)) queue newStates
        traverse (bucketOne, bucketTwo, goal, seen, queue)
    
let measure bucketOne bucketTwo goal startBucket =
    let invalids = [(0, 0); (if startBucket = One then (0, bucketTwo) else (bucketOne, 0))] |> Set.ofList
    traverse (bucketOne, bucketTwo, goal, invalids, ImmutableQueue.Create (if startBucket = One then (bucketOne, 0, 1) else (0, bucketTwo, 1)))

Community comments

Find this solution interesting? Ask the author a question to learn more.

What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

  • What compromises have been made?
  • Are there new concepts here that you could read more about to improve your understanding?