Maxximiliann

Maxximiliann

defmodule ArrangeOpeningCombos do
  def remove_illegal_third_moves_after_e4(potential_line) do
    [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4] = potential_line

    illegal_moves_map = %{
      "Bd3" => [
        "a5",
        "b5",
        "c5",
        "d3",
        "d4",
        "d5",
        "e5",
        "f5",
        "g5",
        "h5",
        "Nd2",
        "Ba3",
        "Bb2",
        "Bc2",
        "Be3",
        "Bf4",
        "Bf5",
        "Bg5",
        "Bg6",
        "Bh6"
      ]
    }

    cond do
      w2 == "Bd3" ->
        illegal_moves_list = Map.get(illegal_moves_map, "Bd3")

        if w3 not in illegal_moves_list do
          "(#{one} #{w1} #{b1} #{two} #{w2} #{b2} #{three} #{w3} #{b3} #{four} #{w4} #{b4}) "
        end

      true ->
        "(#{one} #{w1} #{b1} #{two} #{w2} #{b2} #{three} #{w3} #{b3} #{four} #{w4} #{b4}) "
        # potential_line
    end
  end

  def remove_illegal_second_moves_after_e4(possible_line) do
    [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4] = possible_line

    list_of_illegal_second_moves_after_e4 = [
      "a5",
      "b5",
      "c5",
      "d5",
      "e5",
      "f5",
      "g5",
      "h5",
      "Nd2",
      "Ba3",
      "Bb2",
      "Bd2",
      "Be3",
      "Bf4",
      "Bg5",
      "Bg2",
      "Bh3",
      "Bh6"
    ]

    if w2 not in list_of_illegal_second_moves_after_e4 do
      [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4]
    end
    |> remove_illegal_third_moves_after_e4()
  end

  def remove_illegal_second_moves_after_d4(possible_line) do
    [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4] = possible_line

    list_of_illegal_second_moves_after_d4 = [
      "a5",
      "b5",
      "c5",
      "d5",
      "e5",
      "f5",
      "g5",
      "h5",
      "Ne2",
      "Ba3",
      "Ba6",
      "Bb2",
      "Bb5",
      "Bc4",
      "Bd3",
      "Be2",
      "Bg2",
      "Bh3"
    ]

    if w2 not in list_of_illegal_second_moves_after_d4 do
      "(#{one} #{w1} #{b1} #{two} #{w2} #{b2} #{three} #{w3} #{b3} #{four} #{w4} #{b4}) "
    end

    # |> remove_illegal_third_moves_after_d4()
  end

  def scrub_moves_list(moves_list) do
    Enum.map(
      moves_list,
      fn [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4] = possible_line ->
        cond do
          w1 == "e4" ->
            remove_illegal_second_moves_after_e4(possible_line)

          w1 == "d4" ->
            remove_illegal_second_moves_after_d4(possible_line)

          true ->
            "(#{one} #{w1} #{b1} #{two} #{w2} #{b2} #{three} #{w3} #{b3} #{four} #{w4} #{b4}) "
        end
      end
    )
  end

  def permute([]), do: [[]]

  def permute(list) do
    for x <- list, y <- permute(list -- [x]), do: [x | y]
  end

  def go(opening_moves_string) do
    [
      one,
      white1,
      black1,
      two,
      white2,
      black2,
      three,
      white3,
      black3,
      four,
      white4,
      black4
    ] = String.split(opening_moves_string)

    move_numbering = [one, two, three, four]
    whites_moves_list = [white1, white2, white3, white4]
    blacks_moves_list = [black1, black2, black3, black4]

    permutations = permute(whites_moves_list)

    combinations_list =
      Enum.map(
        permutations,
        fn moves_list ->
          Enum.zip(move_numbering, moves_list)
          |> Enum.zip(blacks_moves_list)
          |> Enum.flat_map(fn {{number, whites_move}, blacks_move} ->
            [number, whites_move, blacks_move]
          end)
        end
      )

    Enum.map(
      combinations_list,
      fn [
           one,
           w1,
           b1,
           two,
           w2,
           b2,
           three,
           w3,
           b3,
           four,
           w4,
           b4
         ] ->
        illegal_first_moves = [
          "a5",
          "b5",
          "c5",
          "d5",
          "e5",
          "f5",
          "g5",
          "h5",
          "Ne2",
          "Nd2",
          "Ba3",
          "Ba6",
          "Bb2",
          "Bb5",
          "Bc4",
          "Bd3",
          "Be2",
          "Bd2",
          "Be3",
          "Bf4",
          "Bg5",
          "Bg2",
          "Bh3",
          "Bh6"
        ]

        if w1 not in illegal_first_moves do
          [one, w1, b1, two, w2, b2, three, w3, b3, four, w4, b4]
        end
      end
    )
    |> Enum.reject(&is_nil(&1))
    |> scrub_moves_list()
    |> Enum.reject(&is_nil(&1))
    |> IO.puts()
  end
end

Output:

Interactive Elixir (1.10.3) - press Ctrl+C to exit (type h() ENTER for help)
Elixir is ready
iex(1)> ArrangeOpeningCombos.go("1. e4 e6 2. d4 Ke7 3. Bd3 f6 4. Ne2 Kf7")
(1. e4 e6 2. d4 Ke7 3. Bd3 f6 4. Ne2 Kf7) (1. e4 e6 2. d4 Ke7 3. Ne2 f6 4. Bd3 Kf7) (1. e4 e6 2. Bd3 Ke7 3. Ne2 f6 4. d4 Kf7) (1. e4 e6 2. Ne2 Ke7 3. d4 f6 4. Bd3 Kf7) (1. e4 e6 2. Ne2 Ke7 3. Bd3 f6 4. d4 Kf7) (1. d4 e6 2. e4 Ke7 3. Bd3 f6 4. Ne2 Kf7) (1. d4 e6 2. e4 Ke7 3. Ne2 f6 4. Bd3 Kf7) 
:ok

Ok, so, I’ve been learning Elixir for about a year now despite having zero programming experience - thanks so much to everyone on here who’s so kindly and generously helped me along the way :slight_smile: :slight_smile: :wink: - and I’d like to get a sense of where I’m at, what I’m doing correctly, what bad habits I’ve picked up along the way, if any, and how I can write code that is more efficient, readable and idiomatic while conforming to best practices. To that end I’ve put together this toy project.

Any and all tips, suggestions, recommendations (and encouragements :slight_smile: ) are warmly welcomed. Thanks again guys! :slight_smile:

First 2 of 2 Posts Switch mode

Eiji

Eiji

With Elixir formatter this is better:

defmodule Example do
  @illegal_moves %{
    "Bd3" => ~w[a5 b5 c5 d3 d4 d5 e5 f5 g5 h5 Nd2 Ba3 Bb2 Bc2 Be3 Bf4 Bf5 Bg5 Bg6 Bh6]
  }
end

as that your list would not be expanded in so many lines …

Shorter:

"(" <> Enum.join(possible_line, " ") <> ") "

Optionally:

illegal_moves_map["Bd3"]

You may use pattern matching for this like:

    Enum.map(moves_list, fn
      [_one, w1 | _rest] = possible_line when w1 in ~w[e4 d4] ->
        remove_illegal_second_moves_after(possible_line, w1)

      possible_line ->
        "(" <> Enum.join(possible_line, " ") <> ") "
    end)

Much better:

        fn moves_list ->
          [move_numbering, moves_list, blacks_moves_list]
          |> Enum.zip()
          |> Enum.flat_map(&Tuple.to_list/1)
        end

scrub_moves_list/1 always returns list, so second Enum.reject/2 is not needed.

Also you can write &is_nil/1.

Finally having "(" <> Enum.join(possible_line, " ") <> ") " multiple times we may want to create a helper function for that.

Maxximiliann

Maxximiliann OP

Great stuff, thanks so very, very much! :slight_smile:

— All posts loaded —

Where Next? Top

Trending in Questions Top

stjefim
Hello! Suppose you are building workflow (order / task / payment) processing system with the following requirements: Each workflow con...
New
jonnycharles
I’m in search of an Elixir library that offers PDF generation capabilities similar to Ruby’s Prawn. While there have been discussions abo...
New
spammy
I’m looking to build a personal workflow to quickly deploy web applications written in elixir/phoenix, for local consumption (ie not on t...
New
dli
Before I dive in myself, did anyone successfully sprinkle Hologram into their existing LiveView app? Looking for hints regarding: Addi...
New
bottlenecked
Hi all, I wanted to ask how the community is dealing with post-release steps. Today we have Ecto migrations, which make sure that the db...
New
roeland
Kia ora, We have been using elixir-google-api to connect to Google Drive. However, with the updates to Tesla due to CVEs this is now bro...
New
rahultumpala
Hello, I have an Elixir backend that implements a custom protocol over TCP. I want to load test the backend and assess the performance o...
New

Other Trending Topics Top

JesseHerrick
Hey, I’m Jesse and I’m the main contributor behind Dexter, a full-featured, lightning-fast Elixir LSP optimized for large codebases. It s...
New
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Damirados
Hello everyone. After busy few months I am happy to announce v0.1.0 of Emerge &amp; Solve. They are GUI (Emerge) and State management (S...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New
ausimian
Emily is an Elixir library that runs Nx computations on Apple’s MLX. Install it as the default Nx backend and Nx, defn, Axon, Nx.Serving,...
New
juhalehtonen
There has been a thread to discuss the Stack Overflow Developer Survey on this forum every year since 2018, so here’s yet another one for...
New

We're in Beta

About us Mission Statement