tuning fail

TODO.md

@@ -20,6 +20,10 @@ https://www.tasnimzotder.com/blog/optimizing-game-of-life-algorithm
   the cells anymore.
 - Speed
   https://conwaylife.com/forums/viewtopic.php?f=7&t=3237
+  Look at try-pointers-and-cells branch, we're using pre-calculated
+  neighbor list of pointers to cells, but it's only a liiiiitle bit
+  better :(
+
 
 - Patterns:
 

rle/rle.go

@@ -120,7 +120,7 @@ func removeWhitespace(input string) string {
 }
 
 // Store a grid to an RLE file
-func StoreGridToRLE(grid [][]uint8, filename, rule string, width, height int) error {
+func StoreGridToRLE(grid [][]bool, filename, rule string, width, height int) error {
 	fd, err := os.Create(filename)
 	if err != nil {
 		return err
@@ -132,7 +132,7 @@ func StoreGridToRLE(grid [][]uint8, filename, rule string, width, height int) er
 		line := ""
 		for x := 0; x < width; x++ {
 			char := "b"
-			if grid[y][x] == 1 {
+			if grid[y][x] {
 				char = "o"
 			}
 

src/config.go

@@ -43,9 +43,9 @@ type Config struct {
 }
 
 const (
-	VERSION = "v0.0.9"
+	VERSION = "v0.0.8"
-	Alive   = 1
+	Alive   = true
-	Dead    = 0
+	Dead    = false
 
 	DEFAULT_GRID_WIDTH  = 600
 	DEFAULT_GRID_HEIGHT = 400

src/grid.go

@@ -12,100 +12,35 @@ import (
 	"github.com/tlinden/golsky/rle"
 )
 
-type Cell struct {
-	State         uint8
-	Neighbors     [8]*Cell
-	NeighborCount int
-}
-
-func (cell *Cell) Count() uint8 {
-	var count uint8
-
-	for idx := 0; idx < cell.NeighborCount; idx++ {
-		count += cell.Neighbors[idx].State
-	}
-
-	return count
-}
-
 type Grid struct {
-	Data   [][]*Cell
+	Data                   [][]bool
+	Width, Height, Density int
 	Empty                  bool
-	Config *Config
 }
 
 // Create new empty grid and allocate Data according to provided dimensions
-func NewGrid(config *Config) *Grid {
+func NewGrid(width, height, density int, empty bool) *Grid {
 	grid := &Grid{
-		Data:   make([][]*Cell, config.Height),
+		Height:  height,
-		Empty:  config.Empty,
+		Width:   width,
-		Config: config,
+		Density: density,
+		Data:    make([][]bool, height),
+		Empty:   empty,
 	}
 
-	// first setup the cells
+	for y := 0; y < height; y++ {
-	for y := 0; y < config.Height; y++ {
+		grid.Data[y] = make([]bool, width)
-		grid.Data[y] = make([]*Cell, config.Width)
-		for x := 0; x < config.Width; x++ {
-			grid.Data[y][x] = &Cell{}
-		}
-	}
-
-	// in a second pass, collect pointers to the neighbors of each cell
-	for y := 0; y < config.Height; y++ {
-		for x := 0; x < config.Width; x++ {
-			grid.SetupNeighbors(x, y)
-		}
 	}
 
 	return grid
 }
 
-func (grid *Grid) SetupNeighbors(x, y int) {
-	idx := 0
-
-	for nbgY := -1; nbgY < 2; nbgY++ {
-		for nbgX := -1; nbgX < 2; nbgX++ {
-			var col, row int
-
-			if grid.Config.Wrap {
-				// In wrap mode we look at all the 8 neighbors surrounding us.
-				// In case we are on an edge we'll look at the neighbor on the
-				//  other side  of the  grid, thus  wrapping lookahead  around
-				// using the mod() function.
-				col = (x + nbgX + grid.Config.Width) % grid.Config.Width
-				row = (y + nbgY + grid.Config.Height) % grid.Config.Height
-
-			} else {
-				// In traditional grid mode the edges are deadly
-				if x+nbgX < 0 || x+nbgX >= grid.Config.Width || y+nbgY < 0 || y+nbgY >= grid.Config.Height {
-					continue
-				}
-
-				col = x + nbgX
-				row = y + nbgY
-			}
-
-			if col == x && row == y {
-				continue
-			}
-
-			grid.Data[y][x].Neighbors[idx] = grid.Data[row][col]
-			grid.Data[y][x].NeighborCount++
-			idx++
-		}
-	}
-}
-
-// count the living neighbors of a cell
-func (grid *Grid) CountNeighbors(x, y int) uint8 {
-	return grid.Data[y][x].Count()
-}
-
 // Create a new 1:1 instance
 func (grid *Grid) Clone() *Grid {
 	newgrid := &Grid{}
 
-	newgrid.Config = grid.Config
+	newgrid.Width = grid.Width
+	newgrid.Height = grid.Height
 	newgrid.Data = grid.Data
 
 	return newgrid
@@ -124,7 +59,7 @@ func (grid *Grid) Copy(other *Grid) {
 func (grid *Grid) Clear() {
 	for y := range grid.Data {
 		for x := range grid.Data[y] {
-			grid.Data[y][x].State = 0
+			grid.Data[y][x] = false
 		}
 	}
 }
@@ -134,8 +69,8 @@ func (grid *Grid) FillRandom() {
 	if !grid.Empty {
 		for y := range grid.Data {
 			for x := range grid.Data[y] {
-				if rand.Intn(grid.Config.Density) == 1 {
+				if rand.Intn(grid.Density) == 1 {
-					grid.Data[y][x].State = 1
+					grid.Data[y][x] = true
 				}
 			}
 		}
@@ -143,9 +78,9 @@ func (grid *Grid) FillRandom() {
 }
 
 func (grid *Grid) Dump() {
-	for y := 0; y < grid.Config.Height; y++ {
+	for y := 0; y < grid.Height; y++ {
-		for x := 0; x < grid.Config.Width; x++ {
+		for x := 0; x < grid.Width; x++ {
-			if grid.Data[y][x].State == 1 {
+			if grid.Data[y][x] {
 				fmt.Print("XX")
 			} else {
 				fmt.Print("  ")
@@ -158,8 +93,8 @@ func (grid *Grid) Dump() {
 // initialize using a given RLE pattern
 func (grid *Grid) LoadRLE(pattern *rle.RLE) {
 	if pattern != nil {
-		startX := (grid.Config.Width / 2) - (pattern.Width / 2)
+		startX := (grid.Width / 2) - (pattern.Width / 2)
-		startY := (grid.Config.Height / 2) - (pattern.Height / 2)
+		startY := (grid.Height / 2) - (pattern.Height / 2)
 		var y, x int
 
 		for rowIndex, patternRow := range pattern.Pattern {
@@ -168,7 +103,7 @@ func (grid *Grid) LoadRLE(pattern *rle.RLE) {
 					x = colIndex + startX
 					y = rowIndex + startY
 
-					grid.Data[y][x].State = 1
+					grid.Data[y][x] = true
 				}
 			}
 		}
@@ -279,7 +214,7 @@ func (grid *Grid) SaveState(filename, rule string) error {
 	for y := range grid.Data {
 		for _, cell := range grid.Data[y] {
 			row := "."
-			if cell.State == 1 {
+			if cell {
 				row = "o"
 			}
 

src/play.go

@@ -4,7 +4,6 @@ import (
 	"fmt"
 	"image"
 	"log"
-	"sync"
 	"unsafe"
 
 	"github.com/hajimehoshi/ebiten/v2"
@@ -22,21 +21,6 @@ const (
 	DEBUG_FORMAT = "FPS: %0.2f, TPG: %d, M: %0.2fMB, Generations: %d\nScale: %.02f, Zoom: %d, Cam: %.02f,%.02f Cursor: %d,%d  %s"
 )
 
-type History struct {
-	Age [][]int64
-}
-
-func NewHistory(height, width int) History {
-	hist := History{}
-
-	hist.Age = make([][]int64, height)
-	for y := 0; y < height; y++ {
-		hist.Age[y] = make([]int64, width)
-	}
-
-	return hist
-}
-
 type ScenePlay struct {
 	Game   *Game
 	Config *Config
@@ -47,7 +31,7 @@ type ScenePlay struct {
 	Clear bool
 
 	Grids         []*Grid       // 2 grids: one current, one next
-	History       History       // holds state of past dead cells for evolution traces
+	History       [][]int64     // holds state of past dead cells for evolution traces
 	Index         int           // points to current grid
 	Generations   int64         // Stats
 	TicksElapsed  int           // tick counter for game speed
@@ -62,7 +46,6 @@ type ScenePlay struct {
 	RunOneStep    bool          // mutable flags from config
 	TPG           int           // current game speed (ticks per game)
 	Theme         Theme
-	RuleCheckFunc func(uint8, uint8) uint8
 }
 
 func NewPlayScene(game *Game, config *Config) Scene {
@@ -100,27 +83,8 @@ func (scene *ScenePlay) SetNext(next SceneName) {
 	scene.Next = next
 }
 
-func (scene *ScenePlay) CheckRuleB3S23(state uint8, neighbors uint8) uint8 {
+func (scene *ScenePlay) CheckRule(state bool, neighbors int) bool {
-	var nextstate uint8
+	var nextstate bool
-
-	check := (9 * state) + neighbors
-
-	switch check {
-	case 11:
-		fallthrough
-	case 12:
-		fallthrough
-	case 3:
-		nextstate = Alive
-	default:
-		nextstate = Dead
-	}
-
-	return nextstate
-}
-
-func (scene *ScenePlay) CheckRuleGeneric(state uint8, neighbors uint8) uint8 {
-	var nextstate uint8
 
 	// The standard Scene of Life is symbolized in rule-string notation
 	// as B3/S23 (23/3 here).  A cell  is born if it has exactly three
@@ -128,9 +92,9 @@ func (scene *ScenePlay) CheckRuleGeneric(state uint8, neighbors uint8) uint8 {
 	// and  dies otherwise. The first  number, or list of  numbers, is
 	// what is required for a dead cell to be born.
 
-	if state != 1 && Contains(scene.Config.Rule.Birth, neighbors) {
+	if !state && Contains(scene.Config.Rule.Birth, neighbors) {
 		nextstate = Alive
-	} else if state == 1 && Contains(scene.Config.Rule.Death, neighbors) {
+	} else if state && Contains(scene.Config.Rule.Death, neighbors) {
 		nextstate = Alive
 	} else {
 		nextstate = Dead
@@ -152,24 +116,17 @@ func (scene *ScenePlay) UpdateCells() {
 	// next grid index, we just xor 0|1 to 1|0
 	next := scene.Index ^ 1
 
-	var wg sync.WaitGroup
-	wg.Add(scene.Config.Height)
-
 	// compute life status of cells
 	for y := 0; y < scene.Config.Height; y++ {
-
-		go func() {
-			defer wg.Done()
-
 		for x := 0; x < scene.Config.Width; x++ {
-				state := scene.Grids[scene.Index].Data[y][x].State // 0|1 == dead or alive
+			state := scene.Grids[scene.Index].Data[y][x] // 0|1 == dead or alive
-				neighbors := scene.Grids[scene.Index].CountNeighbors(x, y)
+			neighbors := scene.CountNeighbors(x, y)      // alive neighbor count
 
 			// actually apply the current rules
-				nextstate := scene.RuleCheckFunc(state, neighbors)
+			nextstate := scene.CheckRule(state, neighbors)
 
 			// change state of current cell in next grid
-				scene.Grids[next].Data[y][x].State = nextstate
+			scene.Grids[next].Data[y][x] = nextstate
 
 			if scene.Config.ShowEvolution {
 				// set history  to current generation so we  can infer the
@@ -177,14 +134,14 @@ func (scene *ScenePlay) UpdateCells() {
 				// deduce the color to use if evolution tracing is enabled
 				// 60FPS:
 				if state != nextstate {
-						scene.History.Age[y][x] = scene.Generations
+					scene.History[y][x] = scene.Generations
-					}
-				}
-			}
-		}()
 				}
 
-	wg.Wait()
+				// 10FPS:
+				//scene.History.Data[y][x] = (state ^ (1 ^ nextstate)) * (scene.Generations - scene.History.Data[y][x])
+			}
+		}
+	}
 
 	// switch grid for rendering
 	scene.Index ^= 1
@@ -413,13 +370,13 @@ func (scene *ScenePlay) SaveRectRLE() {
 		height = scene.Mark.Y - scene.Point.Y
 	}
 
-	grid := make([][]uint8, height)
+	grid := make([][]bool, height)
 
 	for y := 0; y < height; y++ {
-		grid[y] = make([]uint8, width)
+		grid[y] = make([]bool, width)
 
 		for x := 0; x < width; x++ {
-			grid[y][x] = scene.Grids[scene.Index].Data[y+starty][x+startx].State
+			grid[y][x] = scene.Grids[scene.Index].Data[y+starty][x+startx]
 		}
 	}
 
@@ -465,15 +422,15 @@ func (scene *ScenePlay) Update() error {
 }
 
 // set a cell to alive or dead
-func (scene *ScenePlay) ToggleCellOnCursorPos(alive uint8) {
+func (scene *ScenePlay) ToggleCellOnCursorPos(alive bool) {
 	// use cursor pos relative to the world
 	worldX, worldY := scene.Camera.ScreenToWorld(ebiten.CursorPosition())
 	x := int(worldX) / scene.Config.Cellsize
 	y := int(worldY) / scene.Config.Cellsize
 
 	if x > -1 && y > -1 && x < scene.Config.Width && y < scene.Config.Height {
-		scene.Grids[scene.Index].Data[y][x].State = alive
+		scene.Grids[scene.Index].Data[y][x] = alive
-		scene.History.Age[y][x] = 1
+		scene.History[y][x] = 1
 	}
 }
 
@@ -498,7 +455,7 @@ func (scene *ScenePlay) Draw(screen *ebiten.Image) {
 			if scene.Config.ShowEvolution {
 				scene.DrawEvolution(screen, x, y, op)
 			} else {
-				if scene.Grids[scene.Index].Data[y][x].State == 1 {
+				if scene.Grids[scene.Index].Data[y][x] {
 					scene.World.DrawImage(scene.Theme.Tile(ColLife), op)
 				}
 			}
@@ -513,9 +470,9 @@ func (scene *ScenePlay) Draw(screen *ebiten.Image) {
 }
 
 func (scene *ScenePlay) DrawEvolution(screen *ebiten.Image, x, y int, op *ebiten.DrawImageOptions) {
-	age := scene.Generations - scene.History.Age[y][x]
+	age := scene.Generations - scene.History[y][x]
 
-	switch scene.Grids[scene.Index].Data[y][x].State {
+	switch scene.Grids[scene.Index].Data[y][x] {
 	case Alive:
 		if age > 50 && scene.Config.ShowEvolution {
 			scene.World.DrawImage(scene.Theme.Tile(ColOld), op)
@@ -524,7 +481,7 @@ func (scene *ScenePlay) DrawEvolution(screen *ebiten.Image, x, y int, op *ebiten
 		}
 	case Dead:
 		// only draw dead cells in case evolution trace is enabled
-		if scene.History.Age[y][x] > 1 && scene.Config.ShowEvolution {
+		if scene.History[y][x] > 1 && scene.Config.ShowEvolution {
 			switch {
 			case age < 10:
 				scene.World.DrawImage(scene.Theme.Tile(ColAge1), op)
@@ -596,24 +553,17 @@ func (scene *ScenePlay) DrawDebug(screen *ebiten.Image) {
 // load a pre-computed pattern from RLE file
 func (scene *ScenePlay) InitPattern() {
 	scene.Grids[0].LoadRLE(scene.Config.RLE)
-
-	// rule might have changed
-	scene.InitRuleCheckFunc()
 }
 
 // pre-render offscreen cache image
 func (scene *ScenePlay) InitCache() {
-	// setup theme
-	scene.Theme.SetGrid(scene.Config.ShowGrid)
-
-	if !scene.Config.ShowGrid {
-		scene.Cache.Fill(scene.Theme.Color(ColDead))
-		return
-	}
-
 	op := &ebiten.DrawImageOptions{}
 
+	if scene.Config.ShowGrid {
 		scene.Cache.Fill(scene.Theme.Color(ColGrid))
+	} else {
+		scene.Cache.Fill(scene.Theme.Color(ColDead))
+	}
 
 	for y := 0; y < scene.Config.Height; y++ {
 		for x := 0; x < scene.Config.Width; x++ {
@@ -630,8 +580,8 @@ func (scene *ScenePlay) InitCache() {
 
 // initialize grid[s], either using pre-computed from state or rle file, or random
 func (scene *ScenePlay) InitGrid() {
-	grida := NewGrid(scene.Config)
+	grida := NewGrid(scene.Config.Width, scene.Config.Height, scene.Config.Density, scene.Config.Empty)
-	gridb := NewGrid(scene.Config)
+	gridb := NewGrid(scene.Config.Width, scene.Config.Height, scene.Config.Density, scene.Config.Empty)
 
 	// startup is delayed until user has selected options
 	grida.FillRandom()
@@ -641,8 +591,10 @@ func (scene *ScenePlay) InitGrid() {
 		gridb,
 	}
 
-	scene.History = NewHistory(scene.Config.Height, scene.Config.Width)
+	scene.History = make([][]int64, scene.Config.Height)
-
+	for y := 0; y < scene.Config.Height; y++ {
+		scene.History[y] = make([]int64, scene.Config.Width)
+	}
 }
 
 func (scene *ScenePlay) Init() {
@@ -674,8 +626,6 @@ func (scene *ScenePlay) Init() {
 	scene.InitCache()
 
 	if scene.Config.DelayedStart && !scene.Config.Empty {
-		// do not fill the grid when the main menu comes up first, the
-		// user decides interactively what to do
 		scene.Config.Empty = true
 		scene.InitGrid()
 		scene.Config.Empty = false
@@ -701,10 +651,38 @@ func bool2int(b bool) int {
 	return int(*(*byte)(unsafe.Pointer(&b)))
 }
 
-func (scene *ScenePlay) InitRuleCheckFunc() {
+// count the living neighbors of a cell
-	if scene.Config.Rule.Definition == "B3/S23" {
+func (scene *ScenePlay) CountNeighbors(x, y int) int {
-		scene.RuleCheckFunc = scene.CheckRuleB3S23
+	var sum int
+
+	grid := scene.Grids[scene.Index].Data
+
+	for nbgX := -1; nbgX < 2; nbgX++ {
+		for nbgY := -1; nbgY < 2; nbgY++ {
+			var col, row int
+			if scene.Config.Wrap {
+				// In wrap mode we look at all the 8 neighbors surrounding us.
+				// In case we are on an edge we'll look at the neighbor on the
+				//  other side  of the  grid, thus  wrapping lookahead  around
+				// using the mod() function.
+				col = (x + nbgX + scene.Config.Width) % scene.Config.Width
+				row = (y + nbgY + scene.Config.Height) % scene.Config.Height
+
 			} else {
-		scene.RuleCheckFunc = scene.CheckRuleGeneric
+				// In traditional grid mode the edges are deadly
+				if x+nbgX < 0 || x+nbgX >= scene.Config.Width || y+nbgY < 0 || y+nbgY >= scene.Config.Height {
+					continue
 				}
+				col = x + nbgX
+				row = y + nbgY
+			}
+
+			sum += bool2int(grid[row][col])
+		}
+	}
+
+	// don't count ourselfes though
+	sum -= bool2int(grid[y][x])
+
+	return sum
 }

src/rule.go

@@ -9,13 +9,13 @@ import (
 // a GOL rule
 type Rule struct {
 	Definition string
-	Birth      []uint8
+	Birth      []int
-	Death      []uint8
+	Death      []int
 }
 
 // parse one part of a GOL rule into rule slice
-func NumbersToList(numbers string) []uint8 {
+func NumbersToList(numbers string) []int {
-	list := []uint8{}
+	list := []int{}
 
 	items := strings.Split(numbers, "")
 	for _, item := range items {
@@ -24,7 +24,7 @@ func NumbersToList(numbers string) []uint8 {
 			log.Fatalf("failed to parse game rule part <%s>: %s", numbers, err)
 		}
 
-		list = append(list, uint8(num))
+		list = append(list, num)
 	}
 
 	return list

src/theme.go

@@ -26,10 +26,8 @@ const (
 // readily available from play.go
 type Theme struct {
 	Tiles  map[int]*ebiten.Image
-	GridTiles map[int]*ebiten.Image
 	Colors map[int]color.RGBA
 	Name   string
-	ShowGrid  bool
 }
 
 type ThemeDef struct {
@@ -86,14 +84,10 @@ func NewTheme(def ThemeDef, cellsize int, name string) Theme {
 	}
 
 	theme.Tiles = make(map[int]*ebiten.Image, 6)
-	theme.GridTiles = make(map[int]*ebiten.Image, 6)
 
 	for cid, col := range theme.Colors {
 		theme.Tiles[cid] = ebiten.NewImage(cellsize, cellsize)
-		FillCell(theme.Tiles[cid], cellsize, col, 0)
+		FillCell(theme.Tiles[cid], cellsize, col)
-
-		theme.GridTiles[cid] = ebiten.NewImage(cellsize, cellsize)
-		FillCell(theme.GridTiles[cid], cellsize, col, 1)
 	}
 
 	return theme
@@ -103,10 +97,6 @@ func NewTheme(def ThemeDef, cellsize int, name string) Theme {
 // unknown type is being used, which is ok, since the code is the only
 // user anyway
 func (theme *Theme) Tile(col int) *ebiten.Image {
-	if theme.ShowGrid {
-		return theme.GridTiles[col]
-	}
-
 	return theme.Tiles[col]
 }
 
@@ -114,10 +104,6 @@ func (theme *Theme) Color(col int) color.RGBA {
 	return theme.Colors[col]
 }
 
-func (theme *Theme) SetGrid(showgrid bool) {
-	theme.ShowGrid = showgrid
-}
-
 type ThemeManager struct {
 	Theme  string
 	Themes map[string]Theme
@@ -166,11 +152,11 @@ func (manager *ThemeManager) SetCurrentTheme(theme string) {
 //
 // So we don't draw a grid, we just left a grid behind, which saves us
 // from a lot of drawing operations.
-func FillCell(tile *ebiten.Image, cellsize int, col color.RGBA, x int) {
+func FillCell(tile *ebiten.Image, cellsize int, col color.RGBA) {
 	vector.DrawFilledRect(
 		tile,
-		float32(x),
+		float32(1),
-		float32(x),
+		float32(1),
 		float32(cellsize),
 		float32(cellsize),
 		col, false,

various-tests/raygol/.gitignore

@@ -1,2 +0,0 @@
-golsky
-*.o

various-tests/raygol/Makefile

@@ -1,33 +0,0 @@
-CFLAGS = -Wall -Wextra -Werror -O2 -g 
-LDFLAGS= -L/usr/local/lib -lraylib -lGL -lm -lpthread -ldl -lrt -lX11 -g
-CC     = clang
-OBJS   = main.o game.o grid.o
-DST    = golsky
-PREFIX = /usr/local
-UID    = root
-GID    = 0
-MAN    = udpxd.1
-
-.PHONY: all
-all: $(DST)
-
-$(DST): $(OBJS)
-	$(CC) $(OBJS) $(LDFLAGS) -o $(DST)
-
-%.o: %.c
-	$(CC) -c $(CFLAGS) $*.c -o $*.o
-
-.PHONY: clean
-clean:
-	rm -f *.o $(DST)
-
-.PHONY: install
-install: $(DST)
-	install -d -o $(UID) -g $(GID) $(PREFIX)/sbin
-	install -d -o $(UID) -g $(GID) $(PREFIX)/man/man1
-	install -o $(UID) -g $(GID) -m 555 $(DST) $(PREFIX)/sbin/
-	install -o $(UID) -g $(GID) -m 444 $(MAN) $(PREFIX)/man/man1/
-
-.PHONY: run
-run:
-	LD_LIBRARY_PATH=/usr/local/lib ./golsky

various-tests/raygol/game.c

@@ -1,48 +0,0 @@
-#include "game.h"
-#include <stdio.h>
-
-Game *Init(int width, int height, int gridwidth, int gridheight, int density) {
-  struct Game *game = malloc(sizeof(struct Game));
-
-  game->ScreenWidth = width;
-  game->ScreenHeight = height;
-  game->Cellsize = width / gridwidth;
-  game->Width = gridwidth;
-  game->Height = gridheight;
-
-  InitWindow(width, height, "golsky");
-  SetTargetFPS(60);
-
-  game->Grid = NewGrid(gridwidth, gridheight, density);
-
-  return game;
-}
-
-void Update(Game *game) {
-  if (IsKeyDown(KEY_Q)) {
-    game->Done = true;
-    exit(0);
-  }
-}
-
-void Draw(Game *game) {
-  BeginDrawing();
-
-  ClearBackground(RAYWHITE);
-
-  for (int y = 0; y < game->Width; y++) {
-    for (int x = 0; x < game->Height; x++) {
-      if (game->Grid->Data[y][x] == 1) {
-        DrawRectangle(x * game->Cellsize, y * game->Cellsize, game->Cellsize,
-                      game->Cellsize, GREEN);
-      } else {
-        DrawRectangle(x * game->Cellsize, y * game->Cellsize, game->Cellsize,
-                      game->Cellsize, RAYWHITE);
-      }
-    }
-  }
-
-  DrawText("TEST", game->ScreenWidth / 2, 10, 20, RED);
-
-  EndDrawing();
-}

various-tests/raygol/game.h

@@ -1,25 +0,0 @@
-#ifndef _HAVE_GAME_H
-#define _HAVE_GAME_H
-
-#include "grid.h"
-#include "raylib.h"
-#include <stdlib.h>
-
-typedef struct Game {
-  // Camera2D Camera;
-  int ScreenWidth;
-  int ScreenHeight;
-  int Cellsize;
-
-  // Grid dimensions
-  int Width;
-  int Height;
-  bool Done;
-  Grid *Grid;
-} Game;
-
-Game *Init(int width, int height, int gridwidth, int gridheight, int density);
-void Update(Game *game);
-void Draw(Game *game);
-
-#endif

various-tests/raygol/grid.c

@@ -1,28 +0,0 @@
-#include "grid.h"
-
-Grid *NewGrid(int width, int height, int density) {
-  Grid *grid = malloc(sizeof(struct Grid));
-  grid->Width = width;
-  grid->Height = height;
-  grid->Density = density;
-
-  grid->Data = malloc(height * sizeof(int *));
-  for (int y = 0; y < grid->Height; y++) {
-    grid->Data[y] = malloc(width * sizeof(int *));
-  }
-
-  FillRandom(grid);
-
-  return grid;
-}
-
-void FillRandom(Grid *grid) {
-  int r;
-  for (int y = 0; y < grid->Width; y++) {
-    for (int x = 0; x < grid->Height; x++) {
-      r = GetRandomValue(0, grid->Density);
-      if (r == 1)
-        grid->Data[y][x] = r;
-    }
-  }
-}

various-tests/raygol/grid.h

@@ -1,18 +0,0 @@
-#ifndef _HAVE_GRID_H
-#define _HAVE_GRID_H
-
-#include "raylib.h"
-#include <stdio.h>
-#include <stdlib.h>
-
-typedef struct Grid {
-  int Width;
-  int Height;
-  int Density;
-  int **Data;
-} Grid;
-
-Grid *NewGrid(int width, int height, int density);
-void FillRandom(Grid *grid);
-
-#endif

various-tests/raygol/main.c

@@ -1,15 +0,0 @@
-#include "game.h"
-#include "raylib.h"
-
-int main(void) {
-  Game *game = Init(800, 800, 10, 10, 8);
-
-  while (!WindowShouldClose()) {
-    Update(game);
-    Draw(game);
-  }
-
-  CloseWindow();
-  free(game);
-  return 0;
-}

various-tests/writepixel-pointers-int/go.mod

@@ -0,0 +1,13 @@
+module testgol
+
+go 1.22
+
+require (
+	github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895 // indirect
+	github.com/ebitengine/hideconsole v1.0.0 // indirect
+	github.com/ebitengine/purego v0.7.0 // indirect
+	github.com/hajimehoshi/ebiten/v2 v2.7.4 // indirect
+	github.com/jezek/xgb v1.1.1 // indirect
+	golang.org/x/sync v0.7.0 // indirect
+	golang.org/x/sys v0.20.0 // indirect
+)

various-tests/writepixel-pointers-int/go.sum

@@ -0,0 +1,14 @@
+github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895 h1:48bCqKTuD7Z0UovDfvpCn7wZ0GUZ+yosIteNDthn3FU=
+github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895/go.mod h1:XZdLv05c5hOZm3fM2NlJ92FyEZjnslcMcNRrhxs8+8M=
+github.com/ebitengine/hideconsole v1.0.0 h1:5J4U0kXF+pv/DhiXt5/lTz0eO5ogJ1iXb8Yj1yReDqE=
+github.com/ebitengine/hideconsole v1.0.0/go.mod h1:hTTBTvVYWKBuxPr7peweneWdkUwEuHuB3C1R/ielR1A=
+github.com/ebitengine/purego v0.7.0 h1:HPZpl61edMGCEW6XK2nsR6+7AnJ3unUxpTZBkkIXnMc=
+github.com/ebitengine/purego v0.7.0/go.mod h1:ah1In8AOtksoNK6yk5z1HTJeUkC1Ez4Wk2idgGslMwQ=
+github.com/hajimehoshi/ebiten/v2 v2.7.4 h1:X+heODRQ3Ie9F9QFjm24gEZqQd5FSfR9XuT2XfHwgf8=
+github.com/hajimehoshi/ebiten/v2 v2.7.4/go.mod h1:H2pHVgq29rfm5yeQ7jzWOM3VHsjo7/AyucODNLOhsVY=
+github.com/jezek/xgb v1.1.1 h1:bE/r8ZZtSv7l9gk6nU0mYx51aXrvnyb44892TwSaqS4=
+github.com/jezek/xgb v1.1.1/go.mod h1:nrhwO0FX/enq75I7Y7G8iN1ubpSGZEiA3v9e9GyRFlk=
+golang.org/x/sync v0.7.0 h1:YsImfSBoP9QPYL0xyKJPq0gcaJdG3rInoqxTWbfQu9M=
+golang.org/x/sync v0.7.0/go.mod h1:Czt+wKu1gCyEFDUtn0jG5QVvpJ6rzVqr5aXyt9drQfk=
+golang.org/x/sys v0.20.0 h1:Od9JTbYCk261bKm4M/mw7AklTlFYIa0bIp9BgSm1S8Y=
+golang.org/x/sys v0.20.0/go.mod h1:/VUhepiaJMQUp4+oa/7Zr1D23ma6VTLIYjOOTFZPUcA=

various-tests/writepixel-pointers-int/main.go

@@ -0,0 +1,306 @@
+package main
+
+import (
+	"fmt"
+	"log"
+	"math/rand"
+	"os"
+	"os/exec"
+	"runtime/pprof"
+	"unsafe"
+
+	"github.com/hajimehoshi/ebiten/v2"
+	"github.com/hajimehoshi/ebiten/v2/inpututil"
+)
+
+type Images struct {
+	Black, White *ebiten.Image
+}
+
+type Cell struct {
+	State         uint8
+	Neighbors     [8]*Cell
+	NeighborCount int
+}
+
+func bool2int(b bool) int {
+	return int(*(*byte)(unsafe.Pointer(&b)))
+}
+
+func (cell *Cell) Count(x, y int) uint8 {
+	var sum uint8
+
+	for idx := 0; idx < cell.NeighborCount; idx++ {
+		sum += cell.Neighbors[idx].State
+	}
+
+	return sum
+}
+
+func SetNeighbors(grid [][]*Cell, x, y, width, height int) {
+	idx := 0
+	for nbgX := -1; nbgX < 2; nbgX++ {
+		for nbgY := -1; nbgY < 2; nbgY++ {
+			var col, row int
+
+			if x+nbgX < 0 || x+nbgX >= width || y+nbgY < 0 || y+nbgY >= height {
+				continue
+			}
+
+			col = x + nbgX
+			row = y + nbgY
+
+			if col == x && row == y {
+				continue
+			}
+
+			grid[y][x].Neighbors[idx] = grid[row][col]
+			grid[y][x].NeighborCount++
+			idx++
+		}
+	}
+}
+
+type Grid struct {
+	Data                   [][]*Cell
+	Width, Height, Density int
+}
+
+// Create new empty grid and allocate Data according to provided dimensions
+func NewGrid(width, height, density int) *Grid {
+	grid := &Grid{
+		Height:  height,
+		Width:   width,
+		Density: density,
+		Data:    make([][]*Cell, height),
+	}
+
+	for y := 0; y < height; y++ {
+		grid.Data[y] = make([]*Cell, width)
+		for x := 0; x < width; x++ {
+			grid.Data[y][x] = &Cell{}
+
+			if rand.Intn(density) == 1 {
+				grid.Data[y][x].State = 1
+			}
+		}
+	}
+
+	for y := 0; y < height; y++ {
+		for x := 0; x < width; x++ {
+			SetNeighbors(grid.Data, x, y, width, height)
+		}
+	}
+
+	return grid
+}
+
+type Game struct {
+	Width, Height, Cellsize, Density int
+	ScreenWidth, ScreenHeight        int
+	Grids                            []*Grid
+	Index                            int
+	Elapsed                          int64
+	TPG                              int64 // adjust game speed independently of TPS
+	Pause, Debug, Profile, Gridlines bool
+	Pixels                           []byte
+	OffScreen                        *ebiten.Image
+}
+
+func (game *Game) Layout(outsideWidth, outsideHeight int) (int, int) {
+	return game.ScreenWidth, game.ScreenHeight
+}
+
+// live console output of the grid
+func (game *Game) DebugDump() {
+	cmd := exec.Command("clear")
+	cmd.Stdout = os.Stdout
+	cmd.Run()
+
+	if game.Debug {
+		for y := 0; y < game.Height; y++ {
+			for x := 0; x < game.Width; x++ {
+				if game.Grids[game.Index].Data[y][x].State == 1 {
+					fmt.Print("XX")
+				} else {
+					fmt.Print("  ")
+				}
+			}
+			fmt.Println()
+		}
+	}
+	fmt.Printf("FPS: %0.2f\n", ebiten.ActualTPS())
+}
+
+func (game *Game) Init() {
+	// setup two grids, one for display, one for next state
+	grida := NewGrid(game.Width, game.Height, game.Density)
+	gridb := NewGrid(game.Width, game.Height, game.Density)
+
+	game.Grids = []*Grid{
+		grida,
+		gridb,
+	}
+
+	game.Pixels = make([]byte, game.ScreenWidth*game.ScreenHeight*4)
+
+	game.OffScreen = ebiten.NewImage(game.ScreenWidth, game.ScreenHeight)
+}
+
+// count the living neighbors of a cell
+func (game *Game) CountNeighbors(x, y int) uint8 {
+	return game.Grids[game.Index].Data[y][x].Count(x, y)
+}
+
+// the heart of the game
+func (game *Game) CheckRule(state uint8, neighbors uint8) uint8 {
+	var nextstate uint8
+
+	if state == 1 && neighbors == 3 {
+		nextstate = 1
+	} else if state == 1 && (neighbors == 2 || neighbors == 3) {
+		nextstate = 1
+	} else {
+		nextstate = 0
+	}
+
+	return nextstate
+}
+
+// we only  update the cells if  we are not  in pause state or  if the
+// game timer (TPG) is elapsed.
+func (game *Game) UpdateCells() {
+	if game.Pause {
+		return
+	}
+
+	if game.Elapsed < game.TPG {
+		game.Elapsed++
+		return
+	}
+
+	// next grid index. we only have to, so we just xor it
+	next := game.Index ^ 1
+
+	// calculate cell life state, this is the actual game of life
+	for y := 0; y < game.Height; y++ {
+		for x := 0; x < game.Width; x++ {
+			state := game.Grids[game.Index].Data[y][x].State
+			neighbors := game.CountNeighbors(x, y)
+
+			// actually apply the current rules
+			nextstate := game.CheckRule(state, neighbors)
+
+			// change state of current cell in next grid
+			game.Grids[next].Data[y][x].State = nextstate
+		}
+	}
+
+	// switch grid for rendering
+	game.Index ^= 1
+
+	game.Elapsed = 0
+
+	game.UpdatePixels()
+}
+
+func (game *Game) Update() error {
+	game.UpdateCells()
+
+	if inpututil.IsKeyJustPressed(ebiten.KeySpace) {
+		game.Pause = !game.Pause
+	}
+
+	return nil
+}
+
+/*
+*
+r, g, b := color(it)
+
+	78             p := 4 * (i + j*screenWidth)
+	79             gm.offscreenPix[p] = r
+	80             gm.offscreenPix[p+1] = g
+	81             gm.offscreenPix[p+2] = b
+	82             gm.offscreenPix[p+3] = 0xff
+*/
+func (game *Game) UpdatePixels() {
+	var col byte
+
+	gridx := 0
+	gridy := 0
+	idx := 0
+
+	for y := 0; y < game.ScreenHeight; y++ {
+		for x := 0; x < game.ScreenWidth; x++ {
+			gridx = x / game.Cellsize
+			gridy = y / game.Cellsize
+
+			col = 0xff
+			if game.Grids[game.Index].Data[gridy][gridx].State == 1 {
+				col = 0x0
+			}
+
+			if game.Gridlines {
+				if x%game.Cellsize == 0 || y%game.Cellsize == 0 {
+					col = 128
+				}
+			}
+
+			idx = 4 * (x + y*game.ScreenWidth)
+
+			game.Pixels[idx] = col
+			game.Pixels[idx+1] = col
+			game.Pixels[idx+2] = col
+			game.Pixels[idx+3] = 0xff
+
+			idx++
+		}
+	}
+
+	game.OffScreen.WritePixels(game.Pixels)
+}
+
+func (game *Game) Draw(screen *ebiten.Image) {
+	screen.DrawImage(game.OffScreen, nil)
+	game.DebugDump()
+}
+
+func main() {
+	size := 1500
+
+	game := &Game{
+		Width:     size,
+		Height:    size,
+		Cellsize:  4,
+		Density:   8,
+		TPG:       10,
+		Debug:     false,
+		Profile:   true,
+		Gridlines: false,
+	}
+
+	game.ScreenWidth = game.Width * game.Cellsize
+	game.ScreenHeight = game.Height * game.Cellsize
+
+	game.Init()
+
+	ebiten.SetWindowSize(game.ScreenWidth, game.ScreenHeight)
+	ebiten.SetWindowTitle("triangle conway's game of life")
+	ebiten.SetWindowResizingMode(ebiten.WindowResizingModeEnabled)
+
+	if game.Profile {
+		fd, err := os.Create("cpu.profile")
+		if err != nil {
+			log.Fatal(err)
+		}
+		defer fd.Close()
+
+		pprof.StartCPUProfile(fd)
+		defer pprof.StopCPUProfile()
+	}
+
+	if err := ebiten.RunGame(game); err != nil {
+		log.Fatal(err)
+	}
+}

various-tests/writepixel-pointers/go.mod

@@ -0,0 +1,13 @@
+module testgol
+
+go 1.22
+
+require (
+	github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895 // indirect
+	github.com/ebitengine/hideconsole v1.0.0 // indirect
+	github.com/ebitengine/purego v0.7.0 // indirect
+	github.com/hajimehoshi/ebiten/v2 v2.7.4 // indirect
+	github.com/jezek/xgb v1.1.1 // indirect
+	golang.org/x/sync v0.7.0 // indirect
+	golang.org/x/sys v0.20.0 // indirect
+)

various-tests/writepixel-pointers/go.sum

@@ -0,0 +1,14 @@
+github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895 h1:48bCqKTuD7Z0UovDfvpCn7wZ0GUZ+yosIteNDthn3FU=
+github.com/ebitengine/gomobile v0.0.0-20240518074828-e86332849895/go.mod h1:XZdLv05c5hOZm3fM2NlJ92FyEZjnslcMcNRrhxs8+8M=
+github.com/ebitengine/hideconsole v1.0.0 h1:5J4U0kXF+pv/DhiXt5/lTz0eO5ogJ1iXb8Yj1yReDqE=
+github.com/ebitengine/hideconsole v1.0.0/go.mod h1:hTTBTvVYWKBuxPr7peweneWdkUwEuHuB3C1R/ielR1A=
+github.com/ebitengine/purego v0.7.0 h1:HPZpl61edMGCEW6XK2nsR6+7AnJ3unUxpTZBkkIXnMc=
+github.com/ebitengine/purego v0.7.0/go.mod h1:ah1In8AOtksoNK6yk5z1HTJeUkC1Ez4Wk2idgGslMwQ=
+github.com/hajimehoshi/ebiten/v2 v2.7.4 h1:X+heODRQ3Ie9F9QFjm24gEZqQd5FSfR9XuT2XfHwgf8=
+github.com/hajimehoshi/ebiten/v2 v2.7.4/go.mod h1:H2pHVgq29rfm5yeQ7jzWOM3VHsjo7/AyucODNLOhsVY=
+github.com/jezek/xgb v1.1.1 h1:bE/r8ZZtSv7l9gk6nU0mYx51aXrvnyb44892TwSaqS4=
+github.com/jezek/xgb v1.1.1/go.mod h1:nrhwO0FX/enq75I7Y7G8iN1ubpSGZEiA3v9e9GyRFlk=
+golang.org/x/sync v0.7.0 h1:YsImfSBoP9QPYL0xyKJPq0gcaJdG3rInoqxTWbfQu9M=
+golang.org/x/sync v0.7.0/go.mod h1:Czt+wKu1gCyEFDUtn0jG5QVvpJ6rzVqr5aXyt9drQfk=
+golang.org/x/sys v0.20.0 h1:Od9JTbYCk261bKm4M/mw7AklTlFYIa0bIp9BgSm1S8Y=
+golang.org/x/sys v0.20.0/go.mod h1:/VUhepiaJMQUp4+oa/7Zr1D23ma6VTLIYjOOTFZPUcA=

various-tests/writepixel-pointers/main.go

@@ -0,0 +1,306 @@
+package main
+
+import (
+	"fmt"
+	"log"
+	"math/rand"
+	"os"
+	"os/exec"
+	"runtime/pprof"
+	"unsafe"
+
+	"github.com/hajimehoshi/ebiten/v2"
+	"github.com/hajimehoshi/ebiten/v2/inpututil"
+)
+
+type Images struct {
+	Black, White *ebiten.Image
+}
+
+type Cell struct {
+	State         bool
+	Neighbors     [8]*Cell
+	NeighborCount int
+}
+
+func bool2int(b bool) int {
+	return int(*(*byte)(unsafe.Pointer(&b)))
+}
+
+func (cell *Cell) Count(x, y int) int {
+	sum := 0
+
+	for idx := 0; idx < cell.NeighborCount; idx++ {
+		sum += bool2int(cell.Neighbors[idx].State)
+	}
+
+	return sum
+}
+
+func SetNeighbors(grid [][]*Cell, x, y, width, height int) {
+	idx := 0
+	for nbgX := -1; nbgX < 2; nbgX++ {
+		for nbgY := -1; nbgY < 2; nbgY++ {
+			var col, row int
+
+			if x+nbgX < 0 || x+nbgX >= width || y+nbgY < 0 || y+nbgY >= height {
+				continue
+			}
+
+			col = x + nbgX
+			row = y + nbgY
+
+			if col == x && row == y {
+				continue
+			}
+
+			grid[y][x].Neighbors[idx] = grid[row][col]
+			grid[y][x].NeighborCount++
+			idx++
+		}
+	}
+}
+
+type Grid struct {
+	Data                   [][]*Cell
+	Width, Height, Density int
+}
+
+// Create new empty grid and allocate Data according to provided dimensions
+func NewGrid(width, height, density int) *Grid {
+	grid := &Grid{
+		Height:  height,
+		Width:   width,
+		Density: density,
+		Data:    make([][]*Cell, height),
+	}
+
+	for y := 0; y < height; y++ {
+		grid.Data[y] = make([]*Cell, width)
+		for x := 0; x < width; x++ {
+			grid.Data[y][x] = &Cell{}
+
+			if rand.Intn(density) == 1 {
+				grid.Data[y][x].State = true
+			}
+		}
+	}
+
+	for y := 0; y < height; y++ {
+		for x := 0; x < width; x++ {
+			SetNeighbors(grid.Data, x, y, width, height)
+		}
+	}
+
+	return grid
+}
+
+type Game struct {
+	Width, Height, Cellsize, Density int
+	ScreenWidth, ScreenHeight        int
+	Grids                            []*Grid
+	Index                            int
+	Elapsed                          int64
+	TPG                              int64 // adjust game speed independently of TPS
+	Pause, Debug, Profile, Gridlines bool
+	Pixels                           []byte
+	OffScreen                        *ebiten.Image
+}
+
+func (game *Game) Layout(outsideWidth, outsideHeight int) (int, int) {
+	return game.ScreenWidth, game.ScreenHeight
+}
+
+// live console output of the grid
+func (game *Game) DebugDump() {
+	cmd := exec.Command("clear")
+	cmd.Stdout = os.Stdout
+	cmd.Run()
+
+	if game.Debug {
+		for y := 0; y < game.Height; y++ {
+			for x := 0; x < game.Width; x++ {
+				if game.Grids[game.Index].Data[y][x].State {
+					fmt.Print("XX")
+				} else {
+					fmt.Print("  ")
+				}
+			}
+			fmt.Println()
+		}
+	}
+	fmt.Printf("FPS: %0.2f\n", ebiten.ActualTPS())
+}
+
+func (game *Game) Init() {
+	// setup two grids, one for display, one for next state
+	grida := NewGrid(game.Width, game.Height, game.Density)
+	gridb := NewGrid(game.Width, game.Height, game.Density)
+
+	game.Grids = []*Grid{
+		grida,
+		gridb,
+	}
+
+	game.Pixels = make([]byte, game.ScreenWidth*game.ScreenHeight*4)
+
+	game.OffScreen = ebiten.NewImage(game.ScreenWidth, game.ScreenHeight)
+}
+
+// count the living neighbors of a cell
+func (game *Game) CountNeighbors(x, y int) int {
+	return game.Grids[game.Index].Data[y][x].Count(x, y)
+}
+
+// the heart of the game
+func (game *Game) CheckRule(state bool, neighbors int) bool {
+	var nextstate bool
+
+	if state && neighbors == 3 {
+		nextstate = true
+	} else if state && (neighbors == 2 || neighbors == 3) {
+		nextstate = true
+	} else {
+		nextstate = false
+	}
+
+	return nextstate
+}
+
+// we only  update the cells if  we are not  in pause state or  if the
+// game timer (TPG) is elapsed.
+func (game *Game) UpdateCells() {
+	if game.Pause {
+		return
+	}
+
+	if game.Elapsed < game.TPG {
+		game.Elapsed++
+		return
+	}
+
+	// next grid index. we only have to, so we just xor it
+	next := game.Index ^ 1
+
+	// calculate cell life state, this is the actual game of life
+	for y := 0; y < game.Height; y++ {
+		for x := 0; x < game.Width; x++ {
+			state := game.Grids[game.Index].Data[y][x].State
+			neighbors := game.CountNeighbors(x, y)
+
+			// actually apply the current rules
+			nextstate := game.CheckRule(state, neighbors)
+
+			// change state of current cell in next grid
+			game.Grids[next].Data[y][x].State = nextstate
+		}
+	}
+
+	// switch grid for rendering
+	game.Index ^= 1
+
+	game.Elapsed = 0
+
+	game.UpdatePixels()
+}
+
+func (game *Game) Update() error {
+	game.UpdateCells()
+
+	if inpututil.IsKeyJustPressed(ebiten.KeySpace) {
+		game.Pause = !game.Pause
+	}
+
+	return nil
+}
+
+/*
+*
+r, g, b := color(it)
+
+	78             p := 4 * (i + j*screenWidth)
+	79             gm.offscreenPix[p] = r
+	80             gm.offscreenPix[p+1] = g
+	81             gm.offscreenPix[p+2] = b
+	82             gm.offscreenPix[p+3] = 0xff
+*/
+func (game *Game) UpdatePixels() {
+	var col byte
+
+	gridx := 0
+	gridy := 0
+	idx := 0
+
+	for y := 0; y < game.ScreenHeight; y++ {
+		for x := 0; x < game.ScreenWidth; x++ {
+			gridx = x / game.Cellsize
+			gridy = y / game.Cellsize
+
+			col = 0xff
+			if game.Grids[game.Index].Data[gridy][gridx].State {
+				col = 0x0
+			}
+
+			if game.Gridlines {
+				if x%game.Cellsize == 0 || y%game.Cellsize == 0 {
+					col = 128
+				}
+			}
+
+			idx = 4 * (x + y*game.ScreenWidth)
+
+			game.Pixels[idx] = col
+			game.Pixels[idx+1] = col
+			game.Pixels[idx+2] = col
+			game.Pixels[idx+3] = 0xff
+
+			idx++
+		}
+	}
+
+	game.OffScreen.WritePixels(game.Pixels)
+}
+
+func (game *Game) Draw(screen *ebiten.Image) {
+	screen.DrawImage(game.OffScreen, nil)
+	game.DebugDump()
+}
+
+func main() {
+	size := 1500
+
+	game := &Game{
+		Width:     size,
+		Height:    size,
+		Cellsize:  4,
+		Density:   8,
+		TPG:       10,
+		Debug:     false,
+		Profile:   true,
+		Gridlines: false,
+	}
+
+	game.ScreenWidth = game.Width * game.Cellsize
+	game.ScreenHeight = game.Height * game.Cellsize
+
+	game.Init()
+
+	ebiten.SetWindowSize(game.ScreenWidth, game.ScreenHeight)
+	ebiten.SetWindowTitle("triangle conway's game of life")
+	ebiten.SetWindowResizingMode(ebiten.WindowResizingModeEnabled)
+
+	if game.Profile {
+		fd, err := os.Create("cpu.profile")
+		if err != nil {
+			log.Fatal(err)
+		}
+		defer fd.Close()
+
+		pprof.StartCPUProfile(fd)
+		defer pprof.StopCPUProfile()
+	}
+
+	if err := ebiten.RunGame(game); err != nil {
+		log.Fatal(err)
+	}
+}

various-tests/writepixel/main.go

@@ -238,35 +238,7 @@ func (game *Game) Draw(screen *ebiten.Image) {
 }
 
 func main() {
-	//x := 1
+	size := 1500
-	//y := 0
-	col := 1 >> 0xff
-
-	fmt.Printf("col: %d\n", col)
-
-	x := 1
-	y := 2
-	c := 4
-
-	xm := x & (c - 1)
-	ym := y & (c - 1)
-
-	fmt.Println(xm & ym)
-
-	a := 1
-	b := 1
-	//gen := 100
-	hist := 0
-	for gen := 0; gen < 50; gen++ {
-		fmt.Println((a ^ (1 ^ b)) * (gen - hist))
-		if gen == 25 {
-			a = 0
-		}
-	}
-}
-
-func _main() {
-	size := 800
 
 	game := &Game{
 		Width:     size,
@@ -275,7 +247,7 @@ func _main() {
 		Density:   8,
 		TPG:       10,
 		Debug:     false,
-		Profile:   false,
+		Profile:   true,
 		Gridlines: false,
 	}