You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This example demonstrates the IDA* (Iterative Deepening A*) path finding algorithm. It's an efficient way to find the shortest path between two points in a graph or grid.
An implementation and visualization of a binary search tree data structure. This example helps in understanding tree traversal and basic operations on a BST.
This classic chess puzzle challenges you to place eight queens on a chessboard so that no two queens threaten each other. The example provides a solver and visualization.
An introduction to Shader Art Coding, based on the YouTube tutorial by @kishimisu. This example demonstrates how to create interesting visual effects using shaders.
A puzzle game where the objective is to change all digits on a 3x3 grid to 9 by incrementing the values in selected rows and columns.
Contributing
We welcome contributions to this repository! If you have created an interesting
example using raylib/naylib and Nim, feel free to submit it. Please ensure your
code is well-commented and follows the existing style guidelines.