Verifiable/deterministic fair tickets generation for lotteries, raffles and gambling games. :rhinoceros: :four_leaf_clover: :spades: :game_die:

Leafer 小游戏开发案例

Unofficial FreeBSD ports tree leaf contents for games/lutris-freebsd tracking commits to upstream https://github.com/lutris/lutris -- Port of open Gaming platform for Linux --

This is an L-system generator plug-in I created in Autodesk 3ds Max for the Procedural Modelling for Games course. Its function is to generate random trees/plants based on the seed that it is given and the options that are selected. You can change the texture, min/max branch bending, number of iterations, branch thickness, and the type of leaf you want. Every time you generate a tree, it’s always unique. This can make some really interesting and weird looking trees. By far my favorite assignment I got work on while at school.

A quine is a software which outputs its own source code. Quineforge is a very experimental data format for the lossless compression of quines and for translating all possible non-quines (such as pictures of cats, videos, games, GPU matrix multiply algorithms, or nearly anything) into quine form. It uses the (wikipedia page) Chain_rule_for_Kolmogorov_complexity and a 5-way gametree (like a chess or go gametree) to navigate the space of all possible lambda functions. Its security level is planned to be, eventually after the bugs are worked out, enough for the operation of industrial machines and low lag enough to satisfy hardcore gamers. TODO I should copy some of the "fntape" (5 way tree) theory from occamsfuncer readme and various parts of kolmogorov theory. Basically, for example, if we are using sha3_256 (with some pre and post processing of a merkle forest node (or its faster lazy merkle form), then at some few points in a sequence of bits will occur those 256 bits, and the 256 bit ids of other functions, sparsely, and between those are 1 bit at a time opcodes (or 3 or 4 bit opcodes, or something like that), with some opcodes being to say that what follows is a variable size number of 1 bits followed by a 0 bit, then a powOf2 number of bits is a complete binary tree of bits (cbt) which is a lambda function of Lx.Ly.Lz.zxy aka the church encoding of the pair function whose "leafs" are Lx.Ly.x (true) and Lx.L.y.y (false), which goes into the "register" of "fntape" which is basically a lambda datastruct of 2 linkedlists with 5 possible actions from each possible state: move turingtape left (whose cell contents are each a function), move it right, copy register to center of tape, copy center of tape to register, or (heres the only turing complete part) call register on whats at center of turing tape and replace register with what that returns (and using various statistical methods if there is an infinite loop or other nonhalting lambda call it will be given up on quickly before that happens, within some approx specified low lag limits, but compressed forms are expected not to have nonhalters or overly expensive operations etc else they are not shared in the network as often as cheaper faster more useful data structures). So basically theres a bunch of functions, in the space of all possible lambda functions sparsely explored among many computers and people (some of which may be cat memes, minigames, compressed random bitstrings, or whatever) and fntape kind of opcodes aka small bitstrings from one id256 to another id256 such as to say its left child (a few bits of fntape) or its right child etc, or various combinator on eachother, leads to what else. Its a space where, as the name quineforge implies, the distance of bitstring from any function, or from any small set of functions, to any other function, has bigO that is certainly within the distance predicted by kolmogorov complexity theory and which in practice may be able to compete with zip files, 7z files, wavelet sound compression, neuralnet video compression, AIXI compression, andOr any other imaginable kind of compression, and trading compression efficiency for low lag and scalability etc, you might build low lag high voxel count massively multiplayer games with it, or various experiments somewhere within that.

Leaf Hub to have fun in games.

Unofficial FreeBSD ports tree leaf contents for games/minetestmapper-dev tracking https://github.com/minetest/minetestmapper/commits/master

Unofficial FreeBSD ports tree leaf contents for games/godot tracking commits to upstream https://github.com/godotengine/godot

Advanced Stats for Leafs games

Tea Leaf - Ruby Introductory exercises and games

Framework for Unity games (Used in Leaf Burning Simulator)

Introductory ML project that predicts Toronto Maple Leafs games.

Unofficial FreeBSD ports tree leaf contents for games/ryzomcore-dev tracking https://github.com/ryzom/ryzomcore

Unofficial FreeBSD ports tree leaf contents for games/eternallands-dev tracking https://github.com/raduprv/Eternal-Lands

Parsing a nested data string into a tree. "Only leaf nodes have values." Planning to run minimax algorithms on these trees (AI games).

A Steam gameplay visualization project that uses tags as the core and games as leaf nodes to generate a relationship graph, helping you discover your gaming preferences.

I love hockey! So as a big leafs fan I decided to make a project that predicts the outcomes of future games, so that I can have some hope that it is OUR year!

Unofficial FreeBSD ports tree leaf contents for games/panda3d-dev tracking https://github.com/panda3d/panda3d/commits/master If you want to claim this as your own port, you're welcome to do so!

Unofficial FreeBSD ports tree leaf contents for games/minetest-dev tracking https://github.com/minetest/minetest/commits/master also mentioned in my blog post https://daemondesktop.blogspot.com/2021/04/getting-minetest-dev-built.html The repo that began it all.

Unofficial FreeBSD ports tree leaf contents for games/luanti-dev will be tracking https://github.com/luanti-org/luanti/commits/master formerly mentioned in my blog post https://daemondesktop.blogspot.com/2021/04/getting-minetest-dev-built.html The repo that began it all.

Project for WITACE 2021Can integer factorization be done in polynomial time on a classical (non-quantum) computer? Can the discrete logarithm be computed in polynomial time? Can the shortest vector of a lattice be computed in polynomial time on a classical or quantum computer? Can clustered planar drawings be found in polynomial time? Can the graph isomorphism problem be solved in polynomial time? Can leaf powers and k-leaf powers be recognized in polynomial time? Can parity games be solved in polynomial time? Can the rotation distance between two binary trees be computed in polynomial time? Can graphs of bounded clique-width be recognized in polynomial time?[1] Can one find a simple closed quasigeodesic on a convex polyhedron in polynomial time?[2] Can a simultaneous embedding with fixed edges for two given graphs be found in polynomial time?