MyFinder is a unique search engine with a simple privacy concept in mind. We log your searches but none of the data, it's that simple.
Solving chessChess tacticCombinationExpectiminimaxGame treeCombinatorial game theoryChess strategyComputable setRook polynomialMathematical chess problemChess problemInteger complexityAverage-case complexitySieve of sundaramExtensive-form gameHorizon effectFibonacci search techniqueThreefold repetitionGrotesqueMaximum satisfiability problemProbabilistic turing machineFunction problemCantor's theoremEulerian numberBrute-force searchOptimal binary search treeNash equilibriumMotion planningChess rating systemDirichlet's approximation theoremPassed pawnPartition problemKiller heuristicClenshaw algorithmQuantum tic-tac-toeBoole's inequalityHasse principleStochastic gameChess middlegameFermat's last theoremElementary cellular automatonMaster theoremBackgammon opening theoryTopological entropyPure mateHoeffding's inequalityAll-pairs testingLongest path problemBrun's theoremLondon systemJosephus problemEntropy ratePrimitive recursive functionInformation contentGame balanceTheory of computationLefschetz fixed-point theoremCombinatorial number systemPermutation graphPseudo-polynomial timePcp theoremPythagorean additionReplicator equationPoisson distributionLongest increasing subsequenceConway's 99-graph problemUncertainty principleChinese remainder theoremDifferential entropyAlternating permutationMersenne conjecturesRidders' methodPrime number theoremCantor's diagonal argumentKnight's tourMin-entropyCatalan numberPartitionPolyhedral combinatoricsExpspaceParticle swarm optimizationLegendre's constantConstant-recursive sequenceEvaluation functionBernoulli processSteiner tree problemChaitin's constantImpartial gameBinary gcd algorithmCombinatorial optimizationPspacePotential methodCombinatoricsCombinatorial speciesDilworth's theoremFibonacci numberConditional entropyCartesian productGoldbach's weak conjectureAverage path length