Learn web development with Elixir. We use GenServer Behaviour for a stateful backend. The front-end will use Phoenix Channels to communicate with the backend.

Functional Web Development with  Elixir, OTP and Phoenix by The Pragmatic Programmer_ .png

elixir_islands_test.tar.gz

elixir-app

pheonix-app

elixir-app-guesses

island-interface

phoenix-app-compiled

phoenix-app-iex

phoenix-app-form

phoenix-app-new-module

client-connection

presence

phoenix-app-final

without-presence

Elixir and OTP provide exceptional tools to build rock-solid backend applications that scale. In this course, you’ll build a web application in a radically different way, with a backend that holds application state. You’ll use persistent Phoenix Channel connections instead of HTTP’s request-response, and create the full application in distinct, decoupled layers.

In Part 1, you’ll start by building the business logic as a separate application, without Phoenix. You’ll model the application domain with Elixir functions and simple data structures.

In Part 2, you’ll add in the GenServer Behaviour to make managing in-memory state a breeze. 

In Part 3, you’ll build a web interface with Phoenix where you’ll use Phoenix Channels to establish persistent connections between the stateful server and a stateful front-end client.

Needless to say, you’re going to love this way of building web apps!

Functional Web Development with Elixir, OTP and Phoenix

## `:player1_turn` 
Not all state transitions are one-way. State machines often need to revisit previous states based on events in the system. Taking turns in a game is a perfect example of this. In a two-person game, the state transitions back and forth between one player’s turn and the other until one of them wins.

We’re at the point where both players have set their islands, and the game is in `:player1_turn`. When it’s the first player's turn, that player may guess a coordinate and may win the game. No other events are permissible.

When `:player1` guesses a coordinate, the state should transition to `:player2_turn`. And if `:player1` wins, the state should transition to `:game_over`. We’ll focus on the transition from `:player1_turn` to `:player2_turn` first.

# `:player1_turn` 
Not all state transitions are one-way. State machines often need to revisit previous states based on events in the system. Taking turns in a game is a perfect example of this. In a two-person game, the state transitions back and forth between one player’s turn and the other until one of them wins.

We’re at the point where both players have set their islands, and the game is in `:player1_turn`. When it’s the first player's turn, that player may guess a coordinate and may win the game. No other events are permissible.

When `:player1` guesses a coordinate, the state should transition to `:player2_turn`. And if `:player1` wins, the state should transition to `:game_over`. We’ll focus on the transition from `:player1_turn` to `:player2_turn` first.

Player One’s Turn

Introduction

Mapping Our Route

Model Data and Behavior

Working of State Machines

Add OTP for Concurrency and Fault Tolerance

Process Supervision for Recovery

Generate a New Web Interface with Phoenix

Create Persistent Connections with Phoenix Channels

Appendix

Player One’s Turn

`:player1_turn`