LPA Win-Prolog Goodies

All these items have been tested using LPA Win-Prolog.

• Sorting Algorithms
• Binary Trees
• Ternary Trees
• Nearest Neighbour using a kd-tree
• Closest Pair of a Set of Points in the Plane
• Set Operations
• Eight-Puzzle
• DFID Search
• A* Search
• IDA* Search
• Dictionary Look Up
• Simulated Annealing
• Graceful Tree Labelling (SA)
• The N Queens Problem (SA)
• The N Queens Problem
• The Non-Dominating Queens Problem
• Dominoes on a Chessboard New!
• All Partitions of an Integer New!
• The Travelling Salesman Problem (SA)
• The Travelling Salesman Problem (GA)
• The Travelling Salesman Problem (Naïve)
• The Stable Marriage Problem (Gale-Shapley Algorithm)
• Magic Hexagon
• Linear Algebraic Equations
• Other Matrix Operations
• Minimal Enclosing Circle
• Convex Hull
• Quickhull (Convex Hull)
• Graham's Scan (Convex Hull)
• Jarvis's March (Convex Hull)
• Divide-and-Conquer (Convex Hull)
• Anti-podal Pairs, Set Width, Set Diameter
• Minimum Rectangle
• Arbitrary 2D Triangulation
• Naïve 2D Delaunay Triangulation
• The House Puzzle
• Permutations
• Miller-Rabin Primality Test
• Factoring (Fermat's Method)
• Factoring (Pollard's rho Method)
• Factoring (Pollard's p-1 Method)
• Factoring (Williams' p+1 Method)
• Factoring Using Continued Fractions
• Factoring (Shanks' SQUFOF Algorithm)
• Multi-Precision Integer Arithmetic
• Greatest Common Divisor
• Fast Fourier Transform
• Roots of a Polynomial
• Polynomial Operations
• Cyclotomic Polynomials
• Aurifeuillian Factorisation
• X to the Power N
• Linear Regression
• Prime Numbers
• Prime Counting Function
• Hamming's Problem
• Statistics
• Convert Integer to (English) Words
• Convert Integer to (French) Words
• Easter Sunday
• Classic Procedures
• Solution of a Diophantine Equation
• Repeating Decimals
• The Jugs Puzzle
• Map Colouring
• Path between two vertices in a graph
• Dijkstra's Shortest Path Algorithm
• Minimal Spanning Tree of a Graph
• Topological Ordering of a Graph
• Maximum Clique of a Graph
• Graph Colouring
• Hamiltonian Cycle of a Graph
• Generalized Knight's Tour
• Knight's Tour
• Fibonacci Numbers
• Lucas Sequences
• Fermat-Pell Equations
• Cornacchia's Algorithm
• Polynomial Operations
• Sparse Polynomial Operations
• Loan Reimbursements
• Set Covering Problem - Greedy Algorithms
• Exact Cover Problem
• Addition Cryptarithm Solver
• Multiplication Cryptarithm Solver
• Division Cryptarithm Solver
• Flawed Procedures
• append/3
• Perfect Square Tiling
• Pentominoes
• Polyomino Generation
• The Game of Life
• TicTacToe using Alpha-Beta Pruning
• English Solitaire
• A Maze Generator
• The Constraint Satisfaction Problem (CSP)
• A Nonogram Solver using CSP
• A Sudoku Solver
• A Faster Sudoku Solver New!
• Affine Planes of Prime Power Order
• Resolvability of Affine Planes
• Mutually Orthogonal Latin Squares
• Orthogonal Mate of a Latin Square New!
• Transversal Designs
• Bluskov's Construction
• Construction of some (v,5,1)-BIBDs
• Affine Planes and Projective Planes
• Projective Planes and Difference Sets
• Steiner Triple Systems
• Steiner Quadruple Systems
• Arithmetic in the Galois Field GF(p^m)
• The First n Digits of Pi
• The First n Digits of e
• Modular Arithmetic Without Integer Overflow
• Polynomial Operations Modulo a Prime
• Factorization of Polynomials Modulo a Prime
• Square Roots Modulo a Prime
• Square Roots Modulo the Product of Two Primes
• Discrete Logarithm Problem New!
• Perfect Powers
• Knapsack Problems (Dynamic Programming)
• Longest Common Sublist (Dynamic Programming)
• Longest Common Subsequence (Dynamic Programming)
• Longest Increasing Sequence (Dynamic Programming)
• Coin-Changing Problems (Dynamic Programming)
• Shortest Paths (Dynamic Programming)
• Minimum Weight Triangulation (Dynamic Programming)
• Longest Palindromic Sublist (Dynamic Programming)

Home Page