I’ve been spending some time these days working with Blazor. It’s quite an interesting technology, and definitely an excellent alternative to Angular or React or WhateverFancyLibraryJs kids are using these days.
Blazor’s has a lot of nice features and there are few good reasons why could be a good technology to adapt:
- model classes can be shared between client and server. No need to write them twice
- very low learning curve (if you know already .NET and possibly a bit of Razor)
- it’s an open source project, there’s a big community and the documentation is growing as we speak
I’m using it for one of my personal night-time projects and frankly, I’m quite happy. It’s easy to use, performances are good and there’s a nice support for DI, which makes code a lot cleaner.
Moreover, the fact that I can keep my entire codebase in C#, makes me way more comfortable and speeds up the development.
Anyways, a few days ago I learned (a bit late, yes) that John Conway passed away from COVID-19 complications.
For those who don’t know, Conway was one of the most famous mathematicians, active in fields like number theory and combinatorial game theory.
He was also the inventor of a lot of funny math riddles, like the Wizard’s age puzzle, and the famous cellular automaton Game of Life.
It’s an interesting simulation, with incredibly simple rules. Straight from Wikipedia:
Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur: - Any live cell with fewer than two live neighbours dies, as if by underpopulation. - Any live cell with two or three live neighbours lives on to the next generation. - Any live cell with more than three live neighbours dies, as if by overpopulation. - Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
It’s not super complex to code and it’s a good exercise for those interested in 2D graphics. It’s actually one of the first things I coded for Windows Phone, replying to an article by Shawn Hargreaves in 2012 (phew!).
The idea is to initialize two grids of booleans and swap them at each iteration. The current grid holds the state that will be used for rendering. Each update step will loop over the cells and compute the new state based on its neighbours. This will then set as the new value in the corresponding cell of the other grid.
And voilà, our simulation is complete!