[{"_1":2,"_1518":-5,"_1519":-5},"loaderData",{"_3":4,"_1505":1506},"en-layout",{"_5":6,"_7":8},"lang","en","page",{"_9":10,"_1153":1154},"tools",{"_11":12,"_13":14,"_15":16,"_17":18,"_232":233,"_590":591,"_684":685,"_763":764,"_858":859,"_1120":1121},"title","Dev Toolbox","subtitle","Handy Tools for Developers","description","The dev toolbox is a web service provides a variety of tools.","math",{"_11":19,"_15":20,"_21":22,"_139":140},"Math Tools","Online math tools including LaTeX equation converter and binary/decimal/hex number converter.","tex",{"_11":23,"_15":24,"_25":26,"_27":28,"_29":30,"_31":32,"_43":44},"Online LaTeX Equation Converter","Type LaTeX expressions and preview equations in real time. 150+ math symbols with one-click input. Download as PNG, SVG, or MathML.","overview","Type LaTeX expressions and preview equations in real time. Over 150 symbols available for one-click input. Download as PNG, SVG, or MathML.","label","Type an expression:","result","Result:","category",{"_33":34,"_35":36,"_37":38,"_39":40,"_41":42},"+/-","Math","∫","Calculus","∩","Sets","Aᵀ","Matrix","αβ","Greek","guide",{"_11":45,"_46":47,"_48":49,"_50":36,"_51":52,"_53":54,"_55":56,"_57":58,"_59":60,"_61":62,"_63":64,"_65":66,"_67":68,"_137":138},"How to Write LaTeX Math","basicTitle","Basic Formulas","basicDesc","In LaTeX, use \\frac{a}{b} for fractions, x^{2} for exponents, x_{i} for subscripts, and \\sqrt{x} for square roots. Wrap arguments in braces {}.","calculusTitle","calculusDesc","Use \\frac{dy}{dx} for derivatives, \\frac{\\partial f}{\\partial x} for partial derivatives, \\int_{a}^{b} for integrals, and \\lim_{x \\to 0} for limits.","matrixTitle","Linear Algebra","matrixDesc","Use \\vec{a} for vectors, \\begin{pmatrix} ... \\end{pmatrix} for matrices. Also supports A^{T} for transpose, A^{-1} for inverse, and \\vec{a} \\cdot \\vec{b} for dot product.","symbolsTitle","Common Greek Letters","symbolsDesc","Greek letters commonly used in math and physics can be typed with commands like \\alpha and \\theta. For uppercase, capitalize the first letter: \\Sigma.","descLabel","Description","latexCode","LaTeX Code","renderResult","Result","items",{"_69":70,"_71":72,"_73":74,"_75":76,"_77":78,"_79":80,"_81":82,"_83":84,"_85":86,"_87":88,"_89":90,"_91":92,"_93":94,"_95":96,"_97":98,"_99":100,"_101":102,"_103":104,"_105":106,"_107":108,"_109":110,"_111":112,"_113":114,"_115":116,"_117":118,"_119":120,"_121":122,"_123":124,"_125":126,"_127":128,"_129":130,"_131":132,"_133":134,"_135":136},"fraction","Fraction","exponent","Exponent","subscript","Subscript","squareRoot","Square root","bar","Bar (mean)","hat","Hat (estimate)","derivative","Derivative","partialDerivative","Partial derivative","integral","Definite integral","limit","Limit","summation","Summation","product","Product","vectorArrow","Vector (arrow)","vectorBold","Vector (bold)","dotProduct","Dot product","norm","Norm","parenMatrix","Parenthesized matrix","bracketMatrix","Bracketed matrix","inverseMatrix","Inverse matrix","transposeMatrix","Transpose matrix","alpha","Alpha","beta","Beta","gammaGamma","Gamma","deltaDelta","Delta (change)","epsilon","Epsilon","eta","Eta (learning rate)","theta","Theta","lambda","Lambda","mu","Mu (mean)","piPi","Pi","rho","Rho (density / correlation)","sigmaSigma","Sigma (std. dev. / summation)","phiPhi","Phi","omega","Omega","faqTitle","FAQ","dec2bin",{"_11":141,"_15":142,"_25":143,"_144":145,"_146":147,"_148":149,"_150":151,"_152":153,"_154":155,"_43":156,"_217":218},"Binary Converter - Decimal, Hex & Octal","Online tool to convert between binary, octal, decimal, and hexadecimal number systems. Supports 0b, 0o, and 0x prefix notation.","Enter a number and click Convert to instantly convert between different number bases. Supports 0b and 0x notation. Useful for programming and computer science studies.","button","Convert","decimal","Decimal","binary","Binary","quaternary","Quaternary","octal","Octal","hex","Hexadecimal",{"_11":157,"_158":159,"_160":161,"_162":163,"_187":188,"_192":193,"_194":195,"_196":197,"_198":199,"_137":203,"_204":205},"Understanding Number Systems","basesTitle","Number Base Comparison","basesDesc","Different number bases are used in various fields of computing and mathematics. Each base has specific advantages.","bases",[164,171,175,179,183],{"_165":166,"_167":168,"_169":170},"name","Binary (Base 2)","digits","0, 1","useCase","Hardware, digital circuits, bitwise operations",{"_165":172,"_167":173,"_169":174},"Quaternary (Base 4)","0–3","DNA encoding, some signal processing",{"_165":176,"_167":177,"_169":178},"Octal (Base 8)","0–7","Unix file permissions (chmod 755)",{"_165":180,"_167":181,"_169":182},"Decimal (Base 10)","0–9","Everyday counting, human-readable values",{"_165":184,"_167":185,"_169":186},"Hexadecimal (Base 16)","0–9, A–F","Memory addresses, color codes (#FF0000), byte representation","baseHeaders",{"_165":189,"_167":190,"_169":191},"Base","Digits","Common Use","howTitle","How Base Conversion Works","howDesc","To convert a number from one base to another, divide the number repeatedly by the target base and collect the remainders. For example, converting decimal 42 to binary: 42 ÷ 2 = 21 remainder 0, 21 ÷ 2 = 10 remainder 1, 10 ÷ 2 = 5 remainder 0, 5 ÷ 2 = 2 remainder 1, 2 ÷ 2 = 1 remainder 0, 1 ÷ 2 = 0 remainder 1. Reading the remainders bottom-up gives 101010.","tipsTitle","Quick Tips for Programmers","tips",[200,201,202],"In most programming languages, prefix 0b denotes binary (0b1010), 0o denotes octal (0o12), and 0x denotes hexadecimal (0xFF).","One hexadecimal digit represents exactly 4 binary digits (bits). For example, 0xF = 0b1111.","CSS/HTML color codes use hex: #FF5733 means R=255, G=87, B=51.","Frequently Asked Questions","faq",[206,211,214],{"_207":208,"_209":210},"q","Why do computers use binary?","a","Computers use binary because digital circuits have two states: on (1) and off (0). This maps naturally to electrical signals being high or low voltage.",{"_207":212,"_209":213},"Why is hexadecimal popular in programming?","Hexadecimal is compact (one hex digit = 4 bits) and maps neatly to binary. A byte (8 bits) is exactly 2 hex digits, making memory addresses and byte values easy to read.",{"_207":215,"_209":216},"What is the largest number I can convert?","This tool handles JavaScript's safe integer range (up to 2^53 - 1, or 9,007,199,254,740,991). For most practical purposes, this is more than sufficient.","glossary",[219,223,226,229],{"_11":220,"_221":222},"Bit","body","A bit (binary digit) is the smallest unit of data in computing. It can hold a value of either 0 or 1. Eight bits make one byte.",{"_11":224,"_221":225},"Byte","A byte consists of 8 bits and can represent values from 0 to 255 (or 0x00 to 0xFF in hexadecimal). It is the fundamental unit of data storage.",{"_11":227,"_221":228},"Radix (Base)","The radix, or base, of a number system determines how many unique digits are used. For example, base 10 uses digits 0–9, while base 16 uses 0–9 and A–F.",{"_11":230,"_221":231},"Two's Complement","Two's complement is the most common method for representing signed integers in binary. The most significant bit indicates the sign: 0 for positive, 1 for negative.","text",{"_11":234,"_15":235,"_236":237,"_259":260,"_359":360,"_431":432,"_508":509},"Text Tools","Online text tools including JSON formatter, URL encoder/decoder, JSON diff, and XML pretty printer.","urlencode",{"_11":238,"_15":239,"_25":240,"_27":241,"_242":243,"_144":244,"_29":30,"_217":249},"URL Encoder & Decoder","Online tool to encode and decode URLs (percent-encoding) instantly. Supports Unicode and special characters.","Enter text and press the Encode or Decode button to convert. Supports Japanese and special character encoding.","Type the text to encode/decode:","placeholder","",{"_245":246,"_247":248},"encode","Encode","decode","Decode",[250,253,256],{"_11":251,"_221":252},"URL Encode (Percent-encoding)","URL encoding (also known as percent encoding) is a technique for converting characters that are either not allowed in URLs or have special meanings into a format that can be safely transmitted.",{"_11":254,"_221":255},"Characters to be encoded","Characters to be encoded include symbols (such as :, /, ?, #, [, ], @, etc.), reserved characters with special meanings, and non-ASCII characters (such as Japanese or other multilingual characters) that cannot be used directly in URLs.",{"_11":257,"_221":258},"Encoding Method","The general encoding method involves first converting the target characters into their byte representation using UTF-8, then converting each byte into its hexadecimal form, and finally prefixing each hex value with a '%' symbol. For example, the Japanese character 'あ' becomes '%E3%81%82'.","json",{"_11":261,"_15":262,"_25":263,"_27":264,"_144":265,"_266":267,"_268":269,"_270":271,"_272":273,"_274":275,"_29":30,"_43":276,"_217":343},"JSON Formatter & Validator","Online JSON formatter, minifier, and validator with syntax highlighting. Format, compress, sort keys, and validate JSON with detailed error messages.","Paste a JSON string and click Format to get a nicely indented and highlighted output. Use Minify to compress, or Sort Keys to alphabetize object keys. Includes validation, detailed error messages, and syntax highlighting — ideal for API development and debugging.","Type the JSON text to format:","Format","minifyButton","Minify","copyButton","Copy","copiedMessage","Copied!","sortKeysLabel","Sort keys","errorLabel","Error",{"_11":277,"_278":279,"_280":281,"_282":283,"_290":291,"_314":315,"_316":317,"_318":319,"_196":324,"_198":325,"_137":203,"_204":330},"JSON Format Guide","syntaxTitle","JSON Syntax Reference","syntaxDesc","JSON (JavaScript Object Notation) supports six data types. All JSON data must be one of these types, and strings must use double quotes.","syntaxHeaders",{"_284":285,"_286":287,"_288":289},"type","Type","syntax","Syntax","example","Example","syntaxItems",[292,296,300,304,307,311],{"_284":293,"_286":294,"_288":295},"Object","{ \"key\": value }","{ \"name\": \"John\" }",{"_284":297,"_286":298,"_288":299},"Array","[ value, ... ]","[1, 2, 3]",{"_284":301,"_286":302,"_288":303},"String","\"text\"","\"hello\"",{"_284":305,"_286":167,"_288":306},"Number","42, 3.14",{"_284":308,"_286":309,"_288":310},"Boolean","true / false","true",{"_284":312,"_286":313,"_288":313},"Null","null","useCasesTitle","Common Use Cases","useCasesDesc","JSON formatting and validation is essential across many development workflows.","useCases",[320,321,322,323],"API development — Inspect and debug API responses by formatting raw JSON payloads.","Configuration files — Format package.json, tsconfig.json, and other config files for readability.","Data transformation — Verify the output of CSV-to-JSON or XML-to-JSON conversions.","Log analysis — Pretty-print structured JSON logs for easier debugging.","Tips",[326,327,328,329],"Use Minify to strip whitespace and reduce file size for production deployments.","Sort Keys alphabetizes object keys, making JSON easier to compare with diff tools.","Error messages show the position of syntax errors so you can fix them quickly.","Trailing commas are invalid in JSON (unlike JavaScript) — remove them before formatting.",[331,334,337,340],{"_207":332,"_209":333},"Is my data safe when using this tool?","Yes. All processing is done entirely in your browser using JavaScript. Your JSON data is never sent to any server.",{"_207":335,"_209":336},"What is the difference between Format and Minify?","Format adds indentation and line breaks for readability. Minify removes all unnecessary whitespace to produce the most compact representation, which is useful for reducing payload size.",{"_207":338,"_209":339},"Why do I get a trailing comma error?","The JSON specification (RFC 8259) does not allow trailing commas after the last element in an object or array. While JavaScript allows them, you must remove trailing commas for valid JSON.",{"_207":341,"_209":342},"Does Sort Keys change array order?","No. Sort Keys only reorders object keys alphabetically. Array element order is preserved because order is significant in JSON arrays.",[344,347,350,353,356],{"_11":345,"_221":346},"JSON (JavaScript Object Notation)","A lightweight, text-based data interchange format derived from JavaScript. It is language-independent and widely used for APIs, configuration files, and data storage. Defined by RFC 8259.",{"_11":348,"_221":349},"JSON Schema","A vocabulary for annotating and validating JSON documents. It defines the structure, data types, and constraints of JSON data, enabling automated validation of API requests and responses.",{"_11":351,"_221":352},"RFC 8259","The IETF standard that defines the JSON data interchange format. It specifies syntax rules such as requiring double quotes for strings and prohibiting trailing commas.",{"_11":354,"_221":355},"Minification","The process of removing all unnecessary whitespace, line breaks, and indentation from JSON (or other code) to reduce file size. Minified JSON is functionally identical to formatted JSON.",{"_11":357,"_221":358},"Trailing Comma","A comma placed after the last element in an object or array. While allowed in JavaScript and some other languages, trailing commas are invalid in the JSON specification and will cause a parse error.","jsonDiff",{"_11":361,"_15":362,"_25":363,"_27":264,"_144":364,"_29":30,"_43":365,"_217":416},"JSON Diff - Compare & Visualize Differences","Online tool to compare two JSON objects and visualize differences. Spot changes in API responses, config files, and database records.","Enter two JSON objects and click Compare to see the differences highlighted. Useful for comparing API responses and verifying configuration changes.","Compare",{"_11":366,"_367":368,"_369":370,"_371":372,"_388":389,"_314":315,"_316":393,"_318":394,"_196":399,"_400":401,"_198":402,"_137":203,"_204":407},"Understanding JSON Diff","readingTitle","How to Read the Diff Results","readingDesc","The diff output uses symbols and colors to indicate what changed between the two JSON documents.","diffTypes",[373,380,384],{"_374":375,"_376":377,"_378":379},"symbol","+ (green)","operation","ADD","meaning","A new key or value exists in the second JSON that is not in the first.",{"_374":381,"_376":382,"_378":383},"- (red)","REMOVE","A key or value exists in the first JSON but not in the second.",{"_374":385,"_376":386,"_378":387},"- / + (red then green)","UPDATE","A value changed — the old value is shown in red and the new value in green.","diffTypeHeaders",{"_374":390,"_376":391,"_378":392},"Symbol","Operation","Meaning","JSON diff comparison is essential for developers working with structured data.",[395,396,397,398],"API response comparison — Compare responses from different API versions or environments to spot breaking changes.","Config file changes — Verify configuration differences between staging and production environments.","Data migration validation — Ensure data integrity by comparing records before and after migration.","Code review — Quickly identify what changed in JSON-based fixtures, mocks, or test data.","Tips for Accurate Comparison","tipsDesc","Follow these tips to get the most accurate diff results. The tool automatically formats your JSON before comparing, but proper input helps you interpret results more easily.",[403,404,405,406],"Ensure both inputs are valid JSON — the tool will show a syntax error if parsing fails.","Key order does not affect the diff — only values and structural differences are detected.","Arrays are compared by index — reordering array elements will show as changes.","Nested objects are compared recursively — differences at any depth level are detected.",[408,410,413],{"_207":332,"_209":409},"Yes. All comparison is performed entirely in your browser using JavaScript. Your JSON data is never sent to any server.",{"_207":411,"_209":412},"Does key order matter in the comparison?","No. JSON objects are unordered by specification, so {\"a\":1,\"b\":2} and {\"b\":2,\"a\":1} are considered identical. Only actual value differences are shown.",{"_207":414,"_209":415},"Can I compare JSON arrays?","Yes. You can compare JSON arrays as well as objects. Arrays are compared element by element based on their index position.",[417,420,423,426,429],{"_11":418,"_221":419},"Learn about JSON","JSON stands for JavaScript Object Notation and is a lightweight data interchange format. It is a text-based data format that is used to exchange data between different computer systems, applications and programming languages.",{"_11":421,"_221":422},"JSONPath","JSONPath is a query language for JSON, similar to XPath for XML. It allows you to select and extract specific elements from a JSON document using path expressions like $.store.book[0].title.",{"_11":424,"_221":425},"Diff Algorithm","A diff algorithm computes the minimum set of changes needed to transform one data structure into another. For JSON, this involves recursively comparing objects and arrays to detect additions, removals, and value updates at every level of nesting.",{"_11":427,"_221":428},"Nested Object","A nested object is a JSON object contained within another object as a value. For example, {\"user\": {\"name\": \"Alice\"}} has a nested object. JSON diff tools compare nested structures recursively to detect changes at any depth.",{"_11":348,"_221":430},"JSON Schema is a vocabulary for annotating and validating JSON documents. It defines the expected structure, data types, and constraints of a JSON document, making it useful for API contract validation and data quality assurance.","xml",{"_11":433,"_15":434,"_25":435,"_27":436,"_144":265,"_29":30,"_268":269,"_270":271,"_43":437,"_217":492},"XML Formatter - Pretty Print XML","Format and indent compressed XML and SVG in your browser. Syntax highlighting makes structure easy to read at a glance.","Format and indent compressed XML and SVG in your browser. Syntax highlighting makes structure easy to read at a glance. Ideal for debugging API responses and data integrations.","Type the XML document to format:",{"_11":438,"_278":439,"_280":440,"_282":441,"_290":444,"_314":315,"_316":469,"_318":470,"_196":324,"_198":475,"_137":203,"_204":480},"XML Format Guide","XML Syntax Reference","XML (Extensible Markup Language) uses a tree structure of nested elements. Every XML document must have exactly one root element, and all tags must be properly closed.",{"_442":443,"_286":287,"_288":289},"construct","Construct",[445,449,453,457,461,465],{"_442":446,"_286":447,"_288":448},"Element","content","Alice",{"_442":450,"_286":451,"_288":452},"Attribute","","",{"_442":454,"_286":455,"_288":456},"Self-closing","","
",{"_442":458,"_286":459,"_288":460},"Comment","","",{"_442":462,"_286":463,"_288":464},"CDATA","","",{"_442":466,"_286":467,"_288":468},"Declaration","","","XML formatting is useful in many development and data exchange scenarios.",[471,472,473,474],"API debugging — Inspect and format SOAP/REST XML responses for easier analysis.","Configuration files — Format Maven pom.xml, Spring beans, and other config files for readability.","Data interchange — Verify XML exports from databases, spreadsheets, or enterprise systems.","SVG editing — Pretty-print SVG graphics files to understand and modify their structure.",[476,477,478,479],"XML is case-sensitive — and are different elements.","Attribute values must always be quoted with single or double quotes.","Special characters like <, >, and & must be escaped as <, >, and & in text content.","Use CDATA sections to include blocks of text that contain many special characters without escaping.",[481,483,486,489],{"_207":332,"_209":482},"Yes. All processing is done entirely in your browser using JavaScript. Your XML data is never sent to any server.",{"_207":484,"_209":485},"What is the difference between XML and HTML?","XML is a strict, extensible markup language for data representation, while HTML is designed for displaying web pages. XML requires all tags to be closed and is case-sensitive, whereas HTML is more lenient.",{"_207":487,"_209":488},"Can this tool validate XML?","This tool checks for well-formedness (proper nesting and closing of tags). It does not validate against an XML Schema (XSD) or DTD.",{"_207":490,"_209":491},"What indentation does the formatter use?","The formatter uses 2-space indentation by default, which is the most common convention for XML documents.",[493,496,499,502,505],{"_11":494,"_221":495},"XML (Extensible Markup Language)","A markup language for encoding documents in a human-readable and machine-readable format. XML is a W3C standard widely used for data interchange between systems, configuration files, and document formats like SVG and XHTML.",{"_11":497,"_221":498},"Well-formed XML","An XML document that follows all syntax rules: it has exactly one root element, all tags are properly nested and closed, attribute values are quoted, and element names are case-sensitive. A well-formed document can be parsed by any XML parser.",{"_11":500,"_221":501},"XML Schema (XSD)","A W3C standard for defining the structure, content, and data types of XML documents. Unlike DTD, XSD itself is written in XML and supports data types, namespaces, and complex type definitions.",{"_11":503,"_221":504},"Namespace","A mechanism to avoid element name conflicts by qualifying names with a URI. Declared using the xmlns attribute (e.g., xmlns:xsl=\"http://www.w3.org/1999/XSL/Transform\"), namespaces enable combining elements from different vocabularies in a single document.",{"_11":506,"_221":507},"XSLT","Extensible Stylesheet Language Transformations (XSLT) is a language for transforming XML documents into other formats such as HTML, plain text, or different XML structures. It uses template rules to match and process elements.","charCounter",{"_11":510,"_15":511,"_25":512,"_27":513,"_242":514,"_144":515,"_516":517,"_29":518,"_43":534},"Character Counter & Word Counter","Count characters, words, sentences, lines, and paragraphs in real time. Supports with/without spaces. Ideal for social media posts, essays, SEO meta tags, and content writing.","Type or paste text to instantly see character count, line count, paragraph count, and more. Toggle between including or excluding spaces. Useful for reports, social media posts, and SEO meta tag checks.","Enter text:","Type or paste your text here","Count","resetButton","Reset",{"_519":520,"_521":522,"_523":524,"_525":243,"_526":527,"_528":529,"_530":531,"_532":533},"charsWithSpaces","Characters (with spaces)","charsWithoutSpaces","Characters (without spaces)","words","Words","wordsNote","sentences","Sentences","lines","Lines","paragraphs","Paragraphs","manuscriptPages","Manuscript pages",{"_11":535,"_536":537,"_538":539,"_540":541,"_547":548,"_314":315,"_316":573,"_318":574,"_137":203,"_204":580},"Character Count Guide","limitsTitle","Character Limits by Platform","limitsDesc","Many platforms enforce character limits. Here are the key limits you should know.","limitsHeaders",{"_542":543,"_544":545,"_87":546},"service","Service","field","Field","Character Limit","limits",[549,553,557,560,564,566,570],{"_542":550,"_544":551,"_87":552},"X (Twitter)","Post","280 characters (CJK: 140)",{"_542":554,"_544":555,"_87":556},"Instagram","Caption","2,200 characters",{"_542":554,"_544":558,"_87":559},"Profile bio","150 characters",{"_542":561,"_544":562,"_87":563},"YouTube","Title","100 characters",{"_542":561,"_544":62,"_87":565},"5,000 characters",{"_542":567,"_544":568,"_87":569},"Google Search","Title tag","Approx. 60 characters",{"_542":567,"_544":571,"_87":572},"Meta description","Approx. 160 characters","Here are typical scenarios where character counting is essential.",[575,576,577,578,579],"Writing articles or essays with specific word or character requirements","Creating ad copy that must fit within character limits","Checking SEO title tags and meta descriptions for optimal length","Tracking essay or report length for academic submissions","Ensuring social media posts fit within platform character limits",[581,584,587],{"_207":582,"_209":583},"Are spaces included in the character count?","\"Characters (with spaces)\" includes all whitespace, while \"Characters (without spaces)\" excludes spaces, tabs, and line breaks. Choose the metric that fits your needs.",{"_207":585,"_209":586},"Is my text sent to a server?","No, all processing happens in your browser. Your text is never sent to any server.",{"_207":588,"_209":589},"How is manuscript page count calculated?","Based on the Japanese 400-character manuscript paper (genkō yōshi). The character count is divided by 400 to estimate the number of pages.","coding",{"_11":592,"_15":593,"_594":595},"Coding Tools","Online coding tools including Scheme playground for running Lisp code in your browser.","scheme",{"_11":596,"_15":597,"_25":598,"_27":599,"_144":600,"_29":30,"_43":601,"_217":665},"Scheme Playground - Online IDE","Run Scheme (Lisp) code instantly in your browser. Great for SICP exercises, lambda calculus, and learning functional programming.","Type your Scheme code and click Run to see the output instantly. Perfect for SICP (Structure and Interpretation of Computer Programs) exercises and lambda calculus learning.","Type the code:","Run",{"_11":602,"_603":604,"_605":606,"_607":608,"_639":640,"_641":642,"_643":644,"_645":646,"_137":203,"_204":652},"Scheme Programming Guide","basicsTitle","Basic Syntax","basicsDesc","Scheme uses prefix notation (also called Polish notation) where the operator comes before the operands, all wrapped in parentheses.","examples",[609,615,619,623,627,631,635],{"_11":610,"_611":612,"_613":614},"Arithmetic","code","(+ 1 2 3) ; => 6\n(* 4 5) ; => 20\n(- 10 3) ; => 7\n(/ 15 3) ; => 5","desc","Basic math operations. Operators can take multiple arguments.",{"_11":616,"_611":617,"_613":618},"Variables","(define x 42)\n(define name \"hello\")\nx ; => 42","Use define to bind values to names.",{"_11":620,"_611":621,"_613":622},"Functions","(define (square x)\n (* x x))\n(square 5) ; => 25","Define functions with (define (name args...) body).",{"_11":624,"_611":625,"_613":626},"Conditionals","(if (> 3 2)\n \"yes\"\n \"no\") ; => \"yes\"\n\n(cond\n ((< x 0) \"negative\")\n ((= x 0) \"zero\")\n (else \"positive\"))","Use if for simple conditions, cond for multiple branches.",{"_11":628,"_611":629,"_613":630},"Lists","(list 1 2 3) ; => (1 2 3)\n(car '(1 2 3)) ; => 1\n(cdr '(1 2 3)) ; => (2 3)\n(cons 0 '(1 2)) ; => (0 1 2)","Lists are the fundamental data structure. car returns the first element, cdr returns the rest.",{"_11":632,"_611":633,"_613":634},"Lambda (Anonymous Functions)","; Anonymous function\n((lambda (x) (* x x)) 5) ; => 25\n\n; Assign lambda to variable\n(define double\n (lambda (x) (* x 2)))\n(double 7) ; => 14\n\n; Higher-order function\n(map (lambda (x) (+ x 1))\n '(1 2 3)) ; => (2 3 4)","Lambda creates unnamed functions. Essential for functional programming patterns like map and filter.",{"_11":636,"_611":637,"_613":638},"Recursion","(define (fibonacci n)\n (if (<= n 1)\n n\n (+ (fibonacci (- n 1))\n (fibonacci (- n 2)))))\n(fibonacci 10) ; => 55","Scheme relies heavily on recursion instead of loops.","examplesTitle","Code Examples","examplesDesc","Try these examples in the playground above. Click Run to see the results.","conceptsTitle","Key Concepts","concepts",[647,648,649,650,651],"Everything is an expression — Every piece of Scheme code returns a value, including if statements and definitions.","First-class functions — Functions can be passed as arguments, returned from other functions, and stored in variables.","Tail call optimization — Scheme guarantees that tail-recursive functions run in constant stack space, making recursion as efficient as loops.","Lexical scoping — Variables are resolved in the environment where they are defined, not where they are called.","Minimalist design — Scheme has very few special forms. Most functionality is built from a small set of primitives.",[653,656,659,662],{"_207":654,"_209":655},"What is the difference between Scheme and Common Lisp?","Scheme is minimalist with a single namespace and guaranteed tail call optimization. Common Lisp is larger with separate namespaces for functions and variables, and a more extensive standard library. Scheme emphasizes elegance and simplicity.",{"_207":657,"_209":658},"Why are there so many parentheses?","Parentheses in Scheme define the structure of the code (S-expressions). This uniform syntax makes the language easy to parse and enables powerful metaprogramming with macros. Most editors provide auto-matching to make them manageable.",{"_207":660,"_209":661},"Is Scheme still used today?","Yes. Scheme is widely used in computer science education (e.g., the classic textbook SICP). Languages like Racket (a Scheme descendant) are actively developed. Guile Scheme is used as an extension language in GNU software.",{"_207":663,"_209":664},"Does the code run on a server?","No. All code runs entirely in your browser using the LIPS Scheme interpreter (JavaScript-based). Nothing is sent to any server.",[666,669,672,674,677,681],{"_11":667,"_221":668},"Scheme","Scheme is a classic programming language in the Lisp family, created in 1975 by Guy L. Steele and Gerald Jay Sussman at MIT. It is known for its clean, minimalist design and is widely used in computer science education.",{"_11":670,"_221":671},"S-expression","An S-expression (symbolic expression) is the basic syntax unit in Lisp languages. It is either an atom (like a number or symbol) or a list of S-expressions enclosed in parentheses, such as (+ 1 2).",{"_11":124,"_221":673},"Lambda creates an anonymous (unnamed) function. For example, (lambda (x) (* x x)) creates a function that squares its argument. The name comes from lambda calculus, the mathematical foundation of functional programming.",{"_11":675,"_221":676},"Tail Call Optimization","Tail call optimization (TCO) is a technique where the compiler/interpreter reuses the current stack frame for a function call in tail position. This allows recursive functions to run without growing the call stack, preventing stack overflow errors.",{"_11":678,"_221":679,"_680":-7},"SICP","Structure and Interpretation of Computer Programs is a legendary textbook by Harold Abelson and Gerald Jay Sussman. Originally used at MIT, it teaches fundamental programming concepts using Scheme and is freely available online.","link",{"_11":682,"_221":683},"LIPS Interpreter","This playground uses LIPS (Lisp In Parentheses Syntax), a Scheme interpreter written in JavaScript. It supports most R7RS Scheme features and runs entirely in the browser.","network",{"_11":686,"_15":687,"_688":689},"Network Tools","Online network tools including IP address checker with geolocation map display.","ipLocation",{"_11":690,"_15":691,"_25":691,"_43":692,"_217":750},"IP Address & Location Checker","Automatically detects your IP address and approximate location, displayed on an interactive map. Supports IPv4/IPv6. Useful for network diagnostics and privacy checks.",{"_11":693,"_694":695,"_696":697,"_698":699,"_713":714,"_719":720,"_721":722,"_723":724,"_725":726,"_727":728,"_733":734,"_314":315,"_318":735,"_137":203,"_204":740},"Understanding IP Addresses","versionsTitle","IPv4 vs IPv6","versionsDesc","There are two versions of the Internet Protocol in use today.","versions",[700,708],{"_165":701,"_702":703,"_704":705,"_706":707},"IPv4","format","192.168.1.1","addressSpace","About 4.3 billion addresses","status","Most widely used, but addresses are exhausted",{"_165":709,"_702":710,"_704":711,"_706":712},"IPv6","2001:0db8:85a3::8a2e:0370:7334","Virtually unlimited (3.4×10^38)","Gradually being adopted worldwide","versionHeaders",{"_165":715,"_702":716,"_704":717,"_706":718},"Version","Format Example","Address Space","Status","whatIsTitle","What Does Your IP Address Reveal?","whatIsDesc","Your IP address can reveal your approximate geographic location, Internet Service Provider (ISP), and the type of network you are using. However, it does not reveal your exact street address or personal identity.","howItWorksTitle","How IP Geolocation Works","howItWorksDesc","IP addresses are not assigned randomly — they are managed in blocks by region and ISP. This structure makes it possible to estimate an approximate location.","howItWorksSteps",[729,730,731,732],"IANA allocates large IP address blocks to regional registries (APNIC, ARIN, etc.)","Regional registries distribute address blocks to ISPs and organizations in each country","ISPs assign IP addresses to subscribers — at this point, the region and ISP are determined","Geolocation databases collect this allocation data and map IP addresses to locations","howItWorksNote","Because of this, accuracy is limited to the city level at best. Using a VPN or proxy will show a different location than your actual one.",[736,737,738,739],"VPN verification — Confirm your VPN is working by checking if your IP address has changed.","Troubleshooting — Diagnose network issues by identifying your public IP and ISP information.","Geolocation testing — Verify how websites and services detect your location.","Security audits — Check what information your IP address exposes to the internet.",[741,744,747],{"_207":742,"_209":743},"Why does the location shown not match my exact location?","IP geolocation is approximate and typically accurate to the city or region level. Your ISP may route your traffic through a nearby data center, so the displayed location may be the ISP's facility rather than your home.",{"_207":745,"_209":746},"What is the difference between a public and private IP address?","A public IP address is assigned by your ISP and is visible on the internet. Private IP addresses (like 192.168.x.x or 10.x.x.x) are used within your local network and are not directly accessible from the internet.",{"_207":748,"_209":749},"Can someone find my exact location from my IP address?","No. IP geolocation only provides an approximate location, usually at the city level. Only your ISP can map your IP to your physical address, and they are legally required to protect that information.",[751,754,757,760],{"_11":752,"_221":753},"IP Address","An Internet Protocol (IP) address is a numerical label assigned to each device connected to a network. It serves two main purposes: identifying the host and providing the location of the host in the network.",{"_11":755,"_221":756},"ISP (Internet Service Provider)","An ISP is a company that provides internet access to customers. Your ISP assigns your public IP address and can see your internet traffic unless it is encrypted.",{"_11":758,"_221":759},"AS Number (ASN)","An Autonomous System Number identifies a network or group of networks under a single administrative entity. ISPs and large organizations each have their own ASN.",{"_11":761,"_221":762},"Geolocation","IP geolocation is the process of determining the geographic location of a device based on its IP address. Accuracy varies from country-level to city-level depending on the database used.","security",{"_11":765,"_15":766,"_767":768,"_845":846},"Security Tools","Online security tools including SHA hash generator and AI-powered file type detector.","hash",{"_11":769,"_15":770,"_25":771,"_772":773,"_774":775,"_144":776,"_43":777,"_217":829},"SHA Hash Generator (SHA1/SHA256/SHA512)","Generate SHA1, SHA256, SHA384, and SHA512 hash values online. Supports HMAC. All processing happens in your browser for maximum security.","Supports SHA1, SHA256, SHA384, SHA512, and HMAC generation. All hash generation is performed in your browser — your data is never sent to a server or stored anywhere.","label1","Type the text to generate:","label2","HMAC(Optional):","Generate",{"_11":778,"_779":780,"_781":782,"_783":784,"_804":805,"_314":315,"_316":810,"_318":811,"_816":817,"_818":819,"_137":203,"_204":820},"Understanding Hash Functions","algorithmTitle","Algorithm Comparison","algorithmDesc","SHA family algorithms differ in output length, security level, and performance. Choose the right algorithm for your use case.","algorithms",[785,791,796,800],{"_165":786,"_787":788,"_763":789,"_169":790},"SHA-1","output","160 bits (40 hex)","Deprecated","Legacy systems only",{"_165":792,"_787":793,"_763":794,"_169":795},"SHA-256","256 bits (64 hex)","Secure","Digital signatures, SSL/TLS, Bitcoin",{"_165":797,"_787":798,"_763":794,"_169":799},"SHA-384","384 bits (96 hex)","Government, high-security applications",{"_165":801,"_787":802,"_763":794,"_169":803},"SHA-512","512 bits (128 hex)","Maximum security, large data integrity","algorithmHeaders",{"_165":806,"_787":807,"_763":808,"_169":809},"Algorithm","Output Length","Security","Use Case","Hash functions are fundamental to modern security and data integrity verification.",[812,813,814,815],"Password storage — Store hashed passwords instead of plain text for secure authentication.","File integrity — Verify downloaded files have not been corrupted or tampered with by comparing checksums.","Digital signatures — Hash the message before signing to ensure authenticity and integrity.","Data deduplication — Identify duplicate data blocks using their hash values for efficient storage.","hmacTitle","What is HMAC?","hmacDesc","HMAC (Hash-based Message Authentication Code) combines a hash function with a secret key to verify both data integrity and authenticity. Unlike a simple hash, HMAC ensures the message was sent by someone who possesses the secret key. It is widely used in API authentication, JWT tokens, and secure communication protocols.",[821,824,826],{"_207":822,"_209":823},"What is the difference between SHA-256 and SHA-512?","SHA-256 produces a 256-bit hash and SHA-512 produces a 512-bit hash. SHA-512 provides stronger security but SHA-256 is sufficient for most applications. On 64-bit systems, SHA-512 can actually be faster than SHA-256.",{"_207":332,"_209":825},"Yes. All hash generation is performed entirely in your browser using the Web Crypto API. Your data is never sent to any server.",{"_207":827,"_209":828},"Can a hash be reversed to get the original text?","No. Hash functions are one-way — it is computationally infeasible to reverse a hash back to its original input. This is what makes them useful for password storage.",[830,833,836,839,842],{"_11":831,"_221":832},"SHA (Secure Hash Algorithm)","The Secure Hash Algorithm (SHA), abbreviated as SHA, is also known as a cryptographic hash function. It has been designated as the standard hash function, Secure Hash Standard, by the National Institute of Standards and Technology (NIST) in the United States. SHA transforms any large data block into a fixed-size output (typically much shorter than the input).",{"_11":834,"_221":835},"Warning","SHA-1 is now considered vulnerable and should not be used for cryptographic applications.",{"_11":837,"_221":838},"Hash Collision","A hash collision occurs when two different inputs produce the same hash output. Modern algorithms like SHA-256 are designed to make collisions extremely unlikely — the probability is approximately 1 in 2^128.",{"_11":840,"_221":841},"Salt","A salt is random data added to the input of a hash function before hashing. It prevents attackers from using precomputed tables (rainbow tables) to crack password hashes. Each password should have a unique salt.",{"_11":843,"_221":844},"HMAC (Hash-based Message Authentication Code)","HMAC is a mechanism for calculating a message authentication code using a hash function combined with a secret key. It provides both data integrity and authentication, ensuring that the message has not been altered and was sent by someone with the key.","fileScanner",{"_11":847,"_15":848,"_25":849,"_144":850,"_217":851},"File Type Detector - Dr.Filescan","Detect file types using AI-powered analysis by Google Magika. All processing happens in your browser — files are never uploaded.","Drop files to detect their types. Powered by Google's Magika AI. All processing happens in your browser — files are never uploaded anywhere.","Scan file(s)",[852,855],{"_11":853,"_221":854},"Lean about Magika","Magika is a tool to detect common file content types, using deep learning. View project on “https://google.github.io/magika/”.",{"_11":856,"_221":857},"Disclaimer","The service provider has no affiliation with the developers or organizations behind Magika and is solely using it for the purpose of library validation. This service is intended for validating Magika and is not designed for detecting malware in files. The results of file scans are indicative and do not guarantee their accuracy.","geo",{"_11":860,"_15":861,"_862":863,"_954":955,"_1046":1047},"GIS & Geography Tools","Online GIS tools: WKT/GeoJSON converter & viewer, SHP to GeoJSON converter, and Geocode map viewer. All browser-based.","geocode",{"_11":864,"_15":865,"_25":866,"_867":868,"_869":870,"_871":872,"_873":874,"_875":876,"_877":878,"_27":888,"_43":895,"_217":944},"Geocode Viewer - Quadkey, Geohash & Plus Code","Online tool to convert latitude/longitude to Plus Codes, Quadkey, Geohash, and Grid Square Code. Visualize geocode grids on an interactive map.","Enter latitude and longitude to convert to various geocode formats and visualize grids on the map. Supports Plus Codes, Quadkey, Geohash, and Japan Grid Square codes. Useful for GIS development and location verification.","openlocationcode","Open Location Code","quadkey","Quadkey","geohash","Geohash","jisgrid","Grid Square Code","jisgridNote","This tool outputs World Grid Square codes, a global extension of the Japanese Grid Square Code (JIS X 0410). Remove the leading two digits to get the Japanese code.","jisgridLevels",[879,880,881,882,883,884,885,886,887],"1st level (80km)","2nd level (10km)","3rd level (1km)","4th level (500m)","5th level (250m)","6th level (125m)","7th level (25m)","8th level (12.5m)","9th level (5m)",{"_889":890,"_891":892,"_893":894},"radio","Geocode type","lnglat","Longitude and latitude","level","Precision",{"_11":896,"_897":898,"_899":900,"_901":902,"_907":908,"_192":925,"_194":926,"_314":927,"_318":928,"_137":138,"_204":934},"Understanding Geocodes","comparisonTitle","Geocode Format Comparison","comparisonDesc","Several geocode formats exist, each with different characteristics regarding precision, coverage, and intended use cases.","comparisonHeaders",{"_165":265,"_903":894,"_904":905,"_169":906},"precision","developer","Developer","Primary Use Case","comparison",[909,913,917,921],{"_165":868,"_903":910,"_904":911,"_169":912},"~14m × 14m (10-digit)","Google","Sharing locations without street addresses",{"_165":870,"_903":914,"_904":915,"_169":916},"Tile-level dependent","Microsoft","Bing Maps tile indexing and caching",{"_165":872,"_903":918,"_904":919,"_169":920},"~1.2km to ~2cm","Gustavo Niemeyer","Proximity search and database indexing",{"_165":874,"_903":922,"_904":923,"_169":924},"~1km to ~125m","JIS (Japan)","Japanese statistical and administrative data","How Geocodes Work","Geocodes encode latitude and longitude into compact strings by recursively dividing the Earth's surface into smaller grids. Each character in the resulting code narrows down the area, providing progressively finer precision. This approach enables efficient spatial indexing, fast proximity queries, and easy sharing of location information without requiring full coordinate pairs.","Use Cases",[929,930,931,932,933],"Sharing precise locations in areas without formal street addresses","Efficient proximity searches in geospatial databases","Delivery and logistics location pinpointing","Map tile management and caching in web mapping services","Statistical analysis using standardized geographic grid units",[935,938,941],{"_207":936,"_209":937},"What is a Plus Code?","Plus Code is Google's consumer-facing name for Open Location Code. It encodes any location into a short alphanumeric string (e.g., \"8Q7XMQH2+39\"). The \"+\" separates the area code from the local code. Plus Codes are useful for identifying locations in areas without formal addresses.",{"_207":939,"_209":940},"Which format provides the highest precision?","Geohash offers the most flexible precision — adding more characters increases accuracy from ~1.2km down to a few centimeters. Open Location Code provides ~14m precision at 10 digits. The best choice depends on your use case rather than raw precision alone.",{"_207":942,"_209":943},"Can Grid Square Code be used outside Japan?","Yes. The World Grid Square system extends JIS X 0410 (Grid Square Code) globally by dividing the world into 8 regions. The encoding method is identical, and the Japanese grid square code can be derived by removing the first two digits of the world grid square code.",[945,948,950,952],{"_11":946,"_221":947},"Open Location Code (Plus Codes)","The Open Location Code is a geocode based in a system of regular grids for identifying an area anywhere on the Earth. It was developed at Google's Zürich engineering office, and released late October 2014. Location codes created by the Open Location Code system are referred to as \"plus codes\".",{"_11":870,"_221":949},"Quadkey (Quadtree Key) is a geolocation hashing algorithm developed by Microsoft that divides regions based on latitude and longitude into grids of approximately the same size. Each quadkey has a single-digit code, zero to three. By zooming into the next level, each of the four original quadkeys splits into four, and we add another digit to the code.",{"_11":872,"_221":951},"Geohash is a method of encoding geographic location into a short string of characters. The encoded string represents a grid-based approximation of the location, allowing for fast and efficient indexing and retrieval of geographic data.",{"_11":874,"_221":953},"The Japanese grid square code (JIS X 0410) divides the country into nested cells based on latitude and longitude. The 1st level covers about 80km, the 2nd about 10km and the 3rd about 1km, which is the standard grid square used for Grid Square Statistics. Finer levels subdivide the 3rd level into cells of about 500m, 250m and 125m. The World Grid Square code that this tool outputs extends the same scheme to every location on Earth; removing the leading two digits yields exactly the Japanese grid square code.","wktGeojson",{"_11":956,"_15":957,"_25":958,"_27":959,"_43":964,"_217":1031},"WKT to GeoJSON Converter & Map Viewer","Online WKT playground to convert WKT to GeoJSON (and back) and view on an interactive map. Supports PostGIS, SQL Server, and other GIS data.","Enter WKT or GeoJSON to convert between formats and view the result on an interactive map. Supports FeatureCollection to GEOMETRYCOLLECTION conversion. Useful for inspecting geospatial data from PostGIS, SQL Server, and similar systems.",{"_960":961,"_962":963},"wkt","WKT(Well-known text)","geojson","GeoJSON",{"_11":965,"_966":967,"_968":969,"_970":971,"_975":976,"_639":997,"_641":998,"_607":999,"_196":324,"_198":1016,"_137":138,"_204":1021},"WKT & GeoJSON Guide","formatsTitle","Format Comparison","formatsDesc","WKT and GeoJSON are the two most common formats for representing geospatial data. Understanding their differences helps you choose the right format for your workflow.","formatHeaders",{"_972":973,"_960":974,"_962":963},"feature","Feature","WKT","formats",[977,981,985,989,993],{"_972":978,"_960":979,"_962":980},"Format type","Plain text","JSON",{"_972":982,"_960":983,"_962":984},"Primary use","Databases (PostGIS, SQL Server)","Web APIs & frontends",{"_972":986,"_960":987,"_962":988},"Geometry types","POINT, LINESTRING, POLYGON, ...","Point, LineString, Polygon, ...",{"_972":990,"_960":991,"_962":992},"Attribute data","Not supported","Stored in \"properties\"",{"_972":994,"_960":995,"_962":996},"Standard","OGC / ISO 19162","RFC 7946","WKT Examples","Here are common WKT geometry types you can paste into the converter above.",[1000,1004,1008,1012],{"_11":1001,"_960":1002,"_613":1003},"Point","POINT(139.7671 35.6812)","A single coordinate point (Tokyo Station)",{"_11":1005,"_960":1006,"_613":1007},"LineString","LINESTRING(139.7671 35.6812, 139.6917 35.6895, 139.7454 35.6586)","A line connecting two or more points",{"_11":1009,"_960":1010,"_613":1011},"Polygon","POLYGON((139.74 35.67, 139.78 35.67, 139.78 35.70, 139.74 35.70, 139.74 35.67))","A closed area (first and last coordinates must match)",{"_11":1013,"_960":1014,"_613":1015},"MultiPoint","MULTIPOINT((139.7671 35.6812), (135.5023 34.6937))","Multiple separate points (Tokyo and Osaka)",[1017,1018,1019,1020],"Polygon coordinates must form a closed ring — the first and last points must be identical.","GeoJSON coordinates use [longitude, latitude] order, same as WKT.","In PostGIS, use ST_AsText() for WKT and ST_AsGeoJSON() for GeoJSON conversion.","Use FeatureCollection to group multiple geometries with their properties into a single GeoJSON document.",[1022,1025,1028],{"_207":1023,"_209":1024},"Should I use WKT or GeoJSON?","Use WKT for database storage and SQL queries (PostGIS, SQL Server). Use GeoJSON for web APIs, frontend map rendering, and data exchange between web services. Many tools support both, so the choice depends on your primary workflow.",{"_207":1026,"_209":1027},"What is the coordinate order?","Both WKT and GeoJSON use longitude first, then latitude (e.g., POINT(139.7 35.6) or [139.7, 35.6]). This differs from Google Maps and many GPS devices which display latitude first.",{"_207":1029,"_209":1030},"Can 3D coordinates be handled?","Yes. WKT supports POINT Z(139.7 35.6 100) for 3D coordinates. GeoJSON includes the altitude as the third element in the coordinates array: [139.7, 35.6, 100]. Note that altitude support varies across tools.",[1032,1035,1037,1040,1043],{"_11":1033,"_221":1034},"WKT (Well-Known Text)","WKT stands for Well-Known Text, which is a text representation of spatial data used in Geographic Information Systems (GIS). WKT is a standard format for describing geometric objects like points, lines, polygons, and multi-polygons in a way that is both human-readable and machine-readable. WKT is often used to exchange spatial data between different GIS systems or to store geometry information in databases.",{"_11":963,"_221":1036},"GeoJSON (Geographic JavaScript Object Notation) is a lightweight data interchange format for representing geographic spatial data. Based on the JSON format, GeoJSON is well-suited for expressing geographical shapes on a map. It combines the human-readable and machine-parseable features of JSON and is defined by RFC 7946.",{"_11":1038,"_221":1039},"PostGIS","PostGIS is an open-source spatial database extension for PostgreSQL. It adds support for geographic objects, allowing location queries to be run in SQL. PostGIS supports both WKT and GeoJSON formats and is one of the most widely used GIS databases.",{"_11":1041,"_221":1042},"OGC (Open Geospatial Consortium)","The Open Geospatial Consortium is an international organization that develops open standards for geospatial data. WKT, WKB, and many other spatial data formats and protocols are defined as OGC standards.",{"_11":1044,"_221":1045},"FeatureCollection","A FeatureCollection is a GeoJSON object type that contains an array of Feature objects. Each Feature has a geometry (Point, Polygon, etc.) and a properties object for attribute data. FeatureCollections are the standard way to represent multiple geographic features in a single GeoJSON document.","shpGeojson",{"_11":1048,"_15":1049,"_25":1050,"_27":1051,"_43":1055,"_217":1105},"Shapefile (SHP) to GeoJSON Converter","Online tool to convert Shapefile (.shp) to GeoJSON. Upload a ZIP, get WGS84 GeoJSON with map preview. Works with ArcGIS, QGIS, and other GIS tools.","Upload a Shapefile (.shp) as a ZIP file and click Convert to transform it to GeoJSON (WGS84) and preview on the map. Converted to WGS84 coordinate system.",{"_1052":1053,"_962":1054},"shp","Shapefile(zip file format)","List of converted GeoJSON file[s]",{"_11":1056,"_1057":1058,"_1059":1060,"_1061":1062,"_1067":1068,"_1086":1087,"_1088":1089,"_196":324,"_198":1090,"_137":138,"_204":1095},"Shapefile & GeoJSON Guide","componentsTitle","Shapefile Components","componentsDesc","A Shapefile is not a single file but a collection of files with the same base name and different extensions. Understanding these components helps ensure successful conversion.","componentHeaders",{"_1063":1064,"_1065":1066,"_15":62},"extension","Extension","required","Required","components",[1069,1072,1075,1078,1082],{"_1063":1070,"_1065":1066,"_15":1071},".shp","Geometry data (points, lines, polygons)",{"_1063":1073,"_1065":1066,"_15":1074},".shx","Spatial index for the geometry",{"_1063":1076,"_1065":1066,"_15":1077},".dbf","Attribute data (dBASE format)",{"_1063":1079,"_1065":1080,"_15":1081},".prj","Recommended","Coordinate system / projection definition",{"_1063":1083,"_1065":1084,"_15":1085},".cpg","Optional","Character encoding specification","conversionTitle","About the Conversion","conversionDesc","This tool reads Shapefile ZIP archives and converts them to GeoJSON (WGS84). If a .prj file is included, the coordinates are automatically reprojected to WGS84 (EPSG:4326). Attribute data from the .dbf file is preserved in the GeoJSON \"properties\" field. If no .prj file is present, coordinates are assumed to already be in WGS84.",[1091,1092,1093,1094],"Include .shp, .shx, and .dbf files in the ZIP archive — all three are required.","Always include the .prj file for correct coordinate system transformation.","If attribute data contains non-ASCII characters, include a .cpg file specifying the encoding (e.g., UTF-8, Shift_JIS).","The converted GeoJSON files can be downloaded and used in QGIS, Leaflet, Mapbox, and other GIS tools.",[1096,1099,1102],{"_207":1097,"_209":1098},"Which files should I include in the ZIP?","At minimum, include .shp, .shx, and .dbf files. We strongly recommend also including .prj (coordinate system) and .cpg (character encoding) for correct results. All files must share the same base name.",{"_207":1100,"_209":1101},"Is the coordinate system converted automatically?","Yes, if a .prj file is included in the ZIP, coordinates are automatically reprojected to WGS84 (EPSG:4326), the standard for GeoJSON. Without a .prj file, the tool assumes coordinates are already in WGS84.",{"_207":1103,"_209":1104},"How large a Shapefile can be converted?","Since all processing happens in the browser, the practical limit depends on your device's memory. Files up to around 50MB typically work well. For very large datasets, consider using desktop tools like QGIS or ogr2ogr.",[1106,1109,1111,1114,1117],{"_11":1107,"_221":1108},"Shapefile","Shapefile is a widely used geospatial vector data format developed by ESRI. A Shapefile consists of multiple files (.shp, .shx, .dbf, .prj, etc.) that together represent geometry, spatial index, attribute data, and coordinate system information. It is the de facto standard for exchanging vector GIS data.",{"_11":963,"_221":1110},"GeoJSON (Geographic JavaScript Object Notation) is a lightweight data interchange format for representing geographic spatial data. Based on the JSON format, it supports Point, LineString, Polygon, and collection types. Defined by RFC 7946, it is widely used in web mapping applications.",{"_11":1112,"_221":1113},"WGS84 (EPSG:4326)","WGS84 (World Geodetic System 1984) is the standard coordinate reference system used by GPS. It defines latitude and longitude on an ellipsoidal model of the Earth. EPSG:4326 is the identifier code for WGS84. GeoJSON requires all coordinates to be in WGS84.",{"_11":1115,"_221":1116},"EPSG Code","EPSG codes are numeric identifiers for coordinate reference systems, maintained by the International Association of Oil & Gas Producers. Common examples include EPSG:4326 (WGS84), EPSG:3857 (Web Mercator), and EPSG:2451 (JGD2000 Japan Zone 9). The .prj file in a Shapefile defines which coordinate system is used.",{"_11":1118,"_221":1119},"dBASE (.dbf)","dBASE is a legacy database file format used by Shapefiles to store attribute data. The .dbf file contains tabular data associated with each geometric feature. While the format is old, it remains essential for Shapefile compatibility and is read by all GIS software.","web",{"_11":1122,"_15":1123,"_1124":1125},"Web Tools","Online web tools including OGP checker for meta tags and Twitter Card validation.","seo",{"_11":1126,"_15":1127,"_25":1128,"_27":1129,"_144":1130,"_29":30,"_1131":1132,"_217":1133,"_137":138,"_204":1146},"OGP Checker - X (Twitter) Card & Meta Tags","Enter a URL to check OGP tags, meta tags, and Twitter Cards at once. Preview how your page appears when shared on Facebook and X (Twitter) with realistic card mockups.","Enter a URL and click Check to inspect OGP tags, meta tags, and Twitter Card settings. See realistic previews of how your page looks when shared on Facebook, X (Twitter), and Threads.","Page URL to check:","Check","previewTitle","SNS Share Preview",[1134,1137,1140,1143],{"_11":1135,"_221":1136},"What is OGP?","OGP (Open Graph Protocol) is a metadata standard that controls how your content appears when shared on social networks like Facebook. By setting og:title, og:description, and og:image, you can customize the link preview display.",{"_11":1138,"_221":1139},"What are Twitter Cards?","Twitter Cards control how link previews appear when shared on X (Twitter). You can specify card types (summary, summary_large_image, etc.) using twitter:card. If OGP tags are set, they serve as fallbacks when Twitter-specific tags are not present.",{"_11":1141,"_221":1142},"What is robots.txt?","robots.txt is a file that instructs search engine crawlers which pages on your site they can or cannot access. It is placed at the site root and uses User-agent with Disallow/Allow rules for control.",{"_11":1144,"_221":1145},"What is a Canonical Tag?","A canonical tag tells search engines which URL is the authoritative version when duplicate content exists. Specified as , it prevents SEO value from being diluted across multiple URLs.",[1147,1150],{"_207":1148,"_209":1149},"What is the recommended OGP image size?","The recommended OGP image size for both Facebook and X is 1200×630px (aspect ratio 1.91:1). File size should be under 5MB, and supported formats include JPG, PNG, GIF, and WebP.",{"_207":1151,"_209":1152},"OGP not updating?","Social networks cache OGP information, so updates may not reflect immediately. Use Facebook's Sharing Debugger or X's Card Validator to clear the cache. Also, ensure og:image URLs use absolute paths.","games",{"_11":1155,"_13":1156,"_15":1157,"_1158":1159,"_1166":1167,"_1174":1175,"_1192":1193,"_1205":1206,"_1281":1282,"_1303":1304,"_1488":1489,"_1496":1497},"Bit Games","Browser Mini Games","Quick, casual games for whenever you have a moment. All games work on both desktop and mobile browsers.","features",{"_1160":1161,"_1162":1163,"_1164":1165},"free","Runs in browser","noInstall","Desktop & mobile","mobile","Mobile friendly","categories",{"_1168":1169,"_1170":1171,"_1172":1173},"puzzle","Puzzle","arcade","Arcade","simulation","Simulation","minesweeper",{"_11":1176,"_15":1177,"_25":1178,"_1179":1180,"_1181":1182,"_1186":1187,"_1188":1189},"Minesweeper - Classic Puzzle Game","Play Minesweeper online. Three difficulty levels: Beginner, Intermediate, and Expert. Works on mobile.","A classic puzzle game where you clear a minefield without detonating any mines. Three difficulty levels: Beginner, Intermediate, and Expert.","placeFlag","Place a flag","levels",[1183,1184,1185],"Beginner","Intermediate","Expert","rulesTitle","Rules","rules",[1190,1191],"The board is divided into cells, with mines randomly distributed. To win, you need to open all the cells. The number on a cell shows the number of mines adjacent to it. Using this information, you can determine cells that are safe, and cells that contain mines. Cells suspected of being mines can be marked with a flag check the 'Place a flag'.","To start a new game, you can click on the Reset button at the top of the board. The remaining number of mines is displayed in the left corner, and the game timer is displayed in the right corner.","invaders",{"_11":1194,"_15":1195,"_25":1196,"_1197":1198,"_1186":1187,"_1188":1199},"Space Invaders - Retro Arcade Game","Play a classic Space Invaders-style arcade game. Arrow keys to move, Space to shoot. Stage-based gameplay, works on desktop and mobile.","A classic arcade game inspired by Space Invaders. Destroy all the invaders before they reach you! Use arrow keys to move and Space to shoot. Features stage-based progression on desktop and mobile.","controls","Controls: Arrow keys to move, Space to shoot",[1200,1201,1202,1203,1204],"Destroy all invaders to clear the stage. Invaders move left and right, gradually descending.","Use the arrow keys to move your ship left and right. Press the Space key to fire bullets.","Barriers will protect you from enemy fire, but they gradually break down when hit.","If an invader reaches your position or you are hit by enemy fire, the game is over.","Click the screen to start the next level after clearing a stage.","automaton",{"_11":1207,"_15":1208,"_43":1209,"_217":1280},"Cellular Automaton Simulator - Game of Life, ECA","Run Conway's Game of Life and all 256 Elementary Cellular Automaton rules in your browser. Set custom initial states and observe complex pattern generation.",{"_11":1210,"_1211":1212,"_1213":1214,"_1215":1216,"_1217":1218,"_1219":1220,"_1224":1225,"_1242":1243,"_1244":1245,"_1246":1247,"_1248":1249,"_1250":1251,"_1252":1253,"_1254":1255,"_1256":1257,"_1258":1259,"_1260":1261,"_137":138,"_204":1267},"What Are Cellular Automata?","introTitle","Overview","introDesc","Cellular automata (CA) are discrete computational models consisting of a grid of cells, each in one of a finite number of states. At each time step, every cell updates its state simultaneously based on a fixed rule that considers the states of its neighboring cells. Despite their simplicity, cellular automata can produce remarkably complex behaviors — from stable patterns to chaotic dynamics — making them a powerful tool for studying emergence and self-organization.","typesTitle","Types of Cellular Automata","typesDesc","Cellular automata come in many forms depending on their dimensionality, neighborhood definition, and rule structure. This site offers simulators for Conway's Game of Life (2D) and all 256 Elementary Cellular Automaton rules (1D).","typeHeaders",{"_165":285,"_1221":1222,"_288":1223},"dimensions","Dimensions","Notable Example","types",[1226,1230,1234,1238],{"_165":1227,"_1221":1228,"_288":1229},"Elementary CA","1D","Wolfram's 256 rules (Rule 30, Rule 110)",{"_165":1231,"_1221":1232,"_288":1233},"Totalistic CA","1D / 2D","Rules based on sum of neighbor states",{"_165":1235,"_1221":1236,"_288":1237},"Life-like CA","2D","Conway's Game of Life (B3/S23)",{"_165":1239,"_1221":1240,"_288":1241},"Continuous CA","2D+","Lenia, SmoothLife","lifeTitle","Conway's Game of Life","lifeDesc","The Game of Life is a 2D cellular automaton created by mathematician John Horton Conway in 1970. It follows birth/survival rules (B3/S23): a dead cell with exactly 3 live neighbors is born, and a live cell with 2 or 3 live neighbors survives. From these simple rules emerge diverse patterns like gliders and pulsars, and the system has been proven Turing complete.","ecaTitle","Elementary Cellular Automaton (ECA)","ecaDesc","An elementary cellular automaton is the simplest type of CA, where each cell has two states (0/1) and its next state is determined by itself and its two neighbors (3 cells total). Since there are 8 possible combinations of 3 cells, exactly 256 rules (numbered 0–255) exist. They range from Rule 30, which produces chaotic patterns used in random number generation, to Rule 110, which is proven Turing complete.","rule110Title","What Is Rule 110?","rule110Desc","Rule 110 is an elementary cellular automaton rule where each cell's next state is determined by its current state and its two immediate neighbors (3 cells total). The output pattern reads as \"01101110\" in binary, or \"110\" in decimal — hence the name. When run, it produces a distinctive mix of regular triangular patterns and chaotic regions.","historyTitle","Brief History","historyDesc","Cellular automata were first studied by Stanislaw Ulam and John von Neumann in the 1940s at Los Alamos National Laboratory. Von Neumann was interested in self-replicating systems and designed a 2D CA capable of universal computation. In 1970, John Conway created the Game of Life, which became widely popular and demonstrated how complex behavior emerges from simple rules. In the 1980s, Stephen Wolfram systematically studied elementary cellular automata, classifying their behavior into four classes: Class 1 (uniform), Class 2 (periodic), Class 3 (chaotic/random), and Class 4 (complex/edge of chaos). He proposed that simple programs can generate complexity comparable to natural phenomena.","applicationsTitle","Applications","applications",[1262,1263,1264,1265,1266],"Modeling physical phenomena (crystal growth, fluid dynamics, diffusion)","Biological simulations (population dynamics, pattern formation)","Cryptography and random number generation (Rule 30)","Traffic flow simulation and urban planning","Theoretical computer science (computation universality, complexity theory)",[1268,1271,1274,1277],{"_207":1269,"_209":1270},"Are cellular automata Turing complete?","Some are. Rule 110 in elementary cellular automata and Conway's Game of Life have been proven to be Turing complete, meaning they can simulate any computation that a Turing machine can perform.",{"_207":1272,"_209":1273},"What is the difference between Game of Life and Elementary CA?","Game of Life operates on a 2D grid where each cell has 8 neighbors (Moore neighborhood) and uses birth/survival rules. Elementary CA operates on a 1D row where each cell has 2 neighbors, with 256 possible rule sets. Both are deterministic zero-player systems.",{"_207":1275,"_209":1276},"Who invented cellular automata?","The concept was developed by Stanislaw Ulam and John von Neumann in the 1940s. Von Neumann designed a self-replicating CA as a theoretical model for biological reproduction. The field gained popular attention with Conway's Game of Life (1970) and Wolfram's systematic studies (1980s).",{"_207":1278,"_209":1279},"Can I use these simulators on mobile?","Yes. Both the Game of Life and Elementary CA simulators run entirely in your browser and are responsive. Performance depends on your device, but modern smartphones handle them well.",[],"life",{"_11":1283,"_15":1284,"_25":1285,"_1186":1187,"_1188":1286,"_1292":1293,"_1294":1295,"_1301":1302},"Conway's Game of Life Simulator","Experience Conway's Game of Life (B3/S23) in your browser. Place Gliders, Pulsars, Glider Guns and more to observe the birth, survival, and death of cells. Powered by high-speed Bitboard algorithm.","A 2D cellular automaton devised by John Conway in 1970. Simple rules of birth, survival, and death give rise to surprisingly complex patterns like Gliders and Pulsars. Experience high-speed generation updates with the Bitboard algorithm.",[1287,1288,1289,1290,1291],"The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead (or populated and unpopulated, respectively).","The rules are known as B3/S23:","1. Birth (B3): Any dead cell with exactly three live neighbours becomes a live cell.","2. Survival (S23): Any live cell with two or three live neighbours survives.","3. Death: All other live cells die in the next generation. Similarly, all other dead cells stay dead.","aboutTitle","What is Conway's Game of Life?","about",[1296,1297,1298,1299,1300],"The Game of Life is a cellular automaton devised by British mathematician John Horton Conway in 1970. On a two-dimensional grid, cells with two states — alive or dead — evolve through generations following four simple rules.","The only input from the player is the initial configuration; after that, the system evolves automatically, which is why it is called a \"zero-player game.\" A hallmark of the Game of Life is that remarkably complex patterns emerge from simple rules.","Patterns in the Game of Life fall into three main categories: still lifes (Block, Beehive, etc.), oscillators (Blinker, Pulsar, etc.), and spaceships (Glider, Lightweight Spaceship, etc.). The Glider, which travels across the grid indefinitely, is perhaps the most iconic pattern.","The Game of Life has been proven to be Turing complete, meaning it can theoretically simulate any computer program. This property makes it an important model in computation theory, complex systems science, and artificial life research.","This simulator uses a Bitboard algorithm. Each cell's state is represented as a single bit (0/1), and a 64-bit integer holds the state of 64 cells at once. By shifting bits to align neighbor information and using adder logic (AND, XOR) to count live neighbors in parallel, it evaluates the next generation for 64 cells in just a few bitwise operations — dramatically faster than checking cells one by one.","aboutMore","Learn more about the history and applications of cellular automata","eca",{"_11":1305,"_15":1306,"_25":1307,"_27":1308,"_1323":1324,"_1186":1187,"_1325":1326,"_1327":1328,"_1334":1335,"_1336":1337,"_1338":1339,"_1341":1342,"_1343":1344,"_1292":1350,"_1294":1351,"_1353":1354,"_1355":1356,"_1357":1358,"_1359":1360,"_1361":1362,"_1363":1364,"_1365":1366,"_1367":1368,"_1369":1370,"_1301":1302,"_1371":1372,"_1373":1374,"_1375":1376,"_1377":1378,"_1379":1380,"_1381":1382,"_1383":1384,"_1385":1386,"_1387":1388,"_1389":1390,"_1391":1392,"_1393":1394,"_1395":1396,"_1397":1398,"_1399":1400,"_1401":1402,"_1403":1404,"_1405":1406,"_1407":1408,"_1409":1410,"_1411":1412,"_1413":1414,"_1415":1416,"_1417":1418,"_1419":1420,"_1421":1422,"_1423":1424,"_1425":1426,"_1427":1428,"_1429":1430,"_1431":1432,"_1433":1434,"_1435":1436,"_1437":1438,"_1439":1440,"_1441":1442,"_1443":1444,"_1445":1446,"_1447":1448,"_1449":1450,"_1451":1452,"_1453":1454,"_1455":1456,"_1457":1458,"_1459":1460,"_1461":1462,"_1463":1464,"_1465":1466,"_1467":1468,"_1475":1476,"_1477":1478,"_1479":1480,"_1481":1482},"Elementary Cellular Automaton Simulator & Rule Table","Explore all 256 Elementary Cellular Automaton (ECA) rules with the simulator and complete output mapping table. Compare every rule's output for each 3-cell pattern (111 through 000). Simulate Rule 30, Rule 110, and any rule instantly in your browser.","Explore all 256 Elementary Cellular Automaton (ECA) rules with the simulator and complete output mapping table. Enter any rule number to watch its pattern evolve in real time, and compare every rule's output at a glance. Notable rules include Turing-complete Rule 110 and chaotic Rule 30. For a detailed explanation of how ECA works and Wolfram's four classes, see the sections below.",{"_1309":1310,"_1311":1312,"_1313":1314,"_1315":1316,"_1317":1318,"_1319":1320,"_1321":1322},"rule","Rule number(0-255)","initialState","Initial state","initialStateSingle","Single cell","initialStateRandom","Random","pattern","Rule table","currentCells","Current 3 cells","nextGeneration","Next generation","equivalenceMirrorTitle","Left-right symmetry","rulesIntro","An elementary cellular automaton works in the following steps:","rulesSteps",[1329,1330,1331,1332,1333],"Start with a row of cells as the initial state. Each cell holds a state of 0 (dead) or 1 (alive). The cells at each end wrap around to the opposite side, forming a ring (periodic boundary conditions)","For each cell, look at the 3-cell neighborhood: its left neighbor, itself, and its right neighbor","Look up the 3-cell combination in the rule table (a lookup table that defines the next value for each combination) to determine that cell's value in the next generation","Update all cells simultaneously to produce the next generation (compute the next value for every cell first, then replace them all at once)","Repeat steps 2–4 to advance through generations. In this simulator, each generation is drawn as one row from top to bottom","rulesExampleTitle","How rule numbers work","rulesExample","There are 2³ = 8 possible 3-cell combinations (111 through 000), and a rule is a lookup table that specifies the next-generation value (0 or 1) for each. For example, Rule 110:","rulesSteps2",[1340],"The 8 outputs lined up give 01101110₂, which converts to 110₁₀ in decimal — this becomes the rule number. There are 2⁸ = 256 possible rules in total","rulesVisualTitle","Step-by-step example","rulesVisual",[1345,1346,1347,1348,1349],"1. Prepare the initial state\n\n A row of cells, each holding 0 or 1.\n\n Gen 0: [0] [0] [1] [0] [0]","2. Look at each cell's neighborhood\n\n For each cell, look at left, center, and right as a set.\n The cells at each end wrap around to the opposite side, forming a ring (periodic boundary conditions).\n\n left center right\n ↓ ↓ ↓\n [0] [0] [1] [0] [0]","3. Look up the next state in the rule table\n\n Match the 3-cell combination against the rule table to get the next value.\n\n e.g. Rule 110:\n (0,1,0) → rule table lookup → 1","4. Update all cells simultaneously\n\n Apply the rule to every cell at once to produce the next generation.\n\n e.g. Rule 110:\n Gen 0: [0] [0] [1] [0] [0]\n ↓ all cells update at once\n Gen 1: [0] [1] [1] [0] [0]","5. Repeat\n\n Repeat 2→3→4 to advance through generations. Stacking them vertically creates a 2D pattern.","What is an Elementary Cellular Automaton?",[1352],"Elementary Cellular Automata (ECA) were systematically studied by Stephen Wolfram in the 1980s and represent the simplest form of cellular automaton. Despite having only 256 possible rules, their behavior is remarkably diverse. Wolfram classified this behavior into four classes.","aboutClass1Title","Class 1 — Uniform","aboutClass1","Regardless of initial conditions, all cells converge to the same state within a few generations. All information from the initial state is completely lost — the simplest possible behavior.","aboutClass2Title","Class 2 — Periodic","aboutClass2","Settles into stable patterns such as stripes or fixed points and repeats them indefinitely. Some influence from the initial conditions is preserved locally, but overall behavior remains predictably orderly.","aboutClass3Title","Class 3 — Chaotic","aboutClass3","Generates aperiodic, random-looking patterns indefinitely. Tiny differences in initial conditions lead to entirely different outcomes, making long-term prediction impossible. Yet because these patterns are generated by deterministic rules, they can be used as pseudorandom number generators.","aboutClass4Title","Class 4 — Complex","aboutClass4","Sits at the boundary between order (Classes 1–2) and chaos (Class 3). Information neither freezes as in Classes 1–2 nor disperses as in Class 3. In this delicate balance, \"gliders\" — structures that maintain their shape while moving — emerge spontaneously. Gliders can carry information, and their collisions produce new patterns. This ability to preserve, transmit, and transform information is what makes computation possible.","aboutOutro","Among the 256 rules, several stand out: Rule 30 is used for chaotic random number generation, Rule 110 has been proven Turing complete, Rule 90 generates the Sierpinski triangle, and Rule 184 models traffic flow. Below, we explore these and other notable rules by class.","class12Title","Notable Class 1 & 2 Rules — Orderly","class12Intro","In Class 1, rules like Rule 0 (all cells converge to 0) and Rule 255 (all cells converge to 1) cause every cell to reach the same state within a few generations. Class 2, on the other hand, contains many interesting rules — including Sierpinski-family rules that generate fractal patterns and rules that simulate traffic flow.","class3Title","Notable Class 3 Rules — Chaos","class4Title","Notable Class 4 Rules — Complexity","class4Intro","The \"gliders\" described above can be observed in action by running Class 4 rules in the simulator. In Rules 110 and 54, structures that maintain their shape emerge within the periodic background pattern, moving at different speeds. When gliders collide, they produce complex interactions — annihilation, merging, and splitting.","class4TuringTitle","Class 4 Supplement — Turing Completeness","sierpinskiTitle","Sierpinski Triangle","sierpinskiIntro","One of the most famous patterns in ECA is the Sierpinski triangle (Sierpinski gasket). Starting from a single ON cell, a self-similar fractal triangle emerges.","sierpinskiExactTitle","Exact Sierpinski triangle","sierpinskiExact","Rules 18, 90, and 146 produce symmetric Sierpinski triangles. Rule 60 produces a right-leaning triangle, and Rule 102 produces a left-leaning triangle (these two are mirror equivalents).","sierpinskiSingleTitle","Sierpinski from single cell only","sierpinskiSingle","Rules 26, 154, 210, and 218 produce a Sierpinski triangle from a single-cell initial condition, but exhibit different behavior with random initial conditions.","sierpinskiLikeTitle","Sierpinski-like fractals","sierpinskiLike","Rules 22, 122, 126, and 150 produce fractal patterns that resemble the Sierpinski triangle but are not strictly identical to it.","sierpinskiInvertedTitle","Color-Inverted Sierpinski","sierpinskiInverted","Rules 60, 90, and 102 — which generate Sierpinski patterns — are palindrome rules (explained below), and their equivalents Rules 195, 165, and 153 produce color-inverted Sierpinski patterns. Likewise, Rule 126 (Sierpinski-like) is a palindrome rule, and its equivalent Rule 129 produces an inverted Sierpinski-like fractal.","sierpinskiEquivalentTitle","Other Equivalent Sierpinski Rules","sierpinskiEquivalent","Rule 183 (reverse+flip of Rule 18) and Rule 182 (reverse+flip of Rule 146) also produce equivalent Sierpinski patterns.","chaosTitle","Chaos and Complexity","chaosIntro","Of the four classes described above, Class 3 (chaotic) and Class 4 (complex) are the most noteworthy.","chaosClass3Title","Class 3 — Chaos","chaosClass3","Produces aperiodic, random-looking patterns. Rule 30 is famously used in Mathematica's random number generator. Rules 45 and 106 also exhibit chaotic behavior.","chaosClass4Title","Class 4 — Complexity","chaosClass4","Sits at the boundary between orderly Classes 1–2 and chaotic Class 3. Neither fully regular nor fully random, these rules produce \"gliders\" — moving local structures that emerge naturally and interact through collisions. This is what makes them capable of computation, as explained below.","turingTitle","Turing Completeness","turingIntro","Turing completeness means the ability to perform any computation given the right initial conditions. Class 4 (complex) is neither too orderly nor too chaotic, which makes this possible. In orderly rules, information becomes fixed; in chaotic rules, information disperses and is lost. In Class 4, gliders can preserve and transmit information, enabling computation.","turingRule110Title","Rule 110","turingRule110","Proven Turing complete by Matthew Cook in 2004, demonstrating that this simple rule can simulate any computation.","turingRule54Title","Rule 54","turingRule54","Conjectured to be Turing complete, but not yet proven. Like Rule 110, it produces gliders. From a single-cell initial condition, it produces left-right symmetric output.","trafficTitle","Traffic Model","trafficIntro","Rule 184 is a particle-conserving rule used for traffic flow simulation. Treating black cells as cars and white cells as empty space, a car advances one cell if the space ahead is empty, and stops if blocked.","equivalenceTitle","What are Equivalent Rules?","equivalenceIntro","Among the 256 rules, there are \"equivalent rules\" that generate patterns with the same structure. Equivalent rules are related by the following three transformations:","equivalenceMirror","Swapping the left and right cells in each neighborhood pattern (swap) produces a left-right symmetric pattern. When a rule produces symmetric output from a single cell (e.g., Rules 26 and 82, Rules 30 and 86), the transformation looks identical, so use random initial conditions to see the difference.","equivalenceReverseFlipTitle","Black-white symmetry","equivalenceReverseFlip","Reversing the bit order and then flipping each bit (reverse+flip) produces a black-white symmetric pattern. This is different from a simple bit-flip (complement). When the initial condition is also color-inverted, the output becomes the color-inverted version of the original pattern. However, some pairs such as Rule 110 and Rule 137 produce color-inverted patterns even from the same single-cell initial condition.","equivalenceMirrorReverseFlipTitle","Left-right + Black-white symmetry","equivalenceMirrorReverseFlip","Combines the two transformations above. First swaps left and right cells in each neighborhood pattern, then reverses the bit order and flips each bit.","equivalenceNoteTitle","Special Case of Black-White Symmetry — When the Rule Is a Palindrome","equivalenceNote","When a rule's bit string is a palindrome (reads the same forwards and backwards), flipping the input bits alone causes the output bits to flip as well. Normally, black-white symmetry requires reverse+flip (reversing the order then flipping), but for palindrome rules the bit string is unchanged when reversed, so flip alone is sufficient. For example, Rule 90 (01011010) is a palindrome, so 255 - 90 = Rule 165 (10100101) is its equivalent.","equivalenceCautionTitle","Note","equivalenceCaution","The swap in left-right symmetry swaps the left and right cells of each neighborhood pattern (3 bits). For example, neighborhood pattern 110 (position 6) becomes 011 (position 3) when left and right are swapped, so bit positions 6 and 3 are exchanged in the rule's bit string (8 bits). Similarly, 100 (position 4) and 001 (position 1) are exchanged. Symmetric patterns (111, 101, 010, 000) remain unchanged. For example, Rule 110 (01101110): bit positions 6 and 3 are both 1 (unchanged), while bit position 4 (0) and position 1 (1) are swapped, giving 01111100 = Rule 124.","independentRulesTitle","The 88 Independent Rules","independentRulesIntro","Applying the three equivalence transformations above reduces the 256 ECA rules to 88 independent representatives. Every other rule is equivalent to one of these.","allRulesTitle","All 256 Rules — Output Mapping Table","allRulesCaption","Complete output mapping for all 256 ECA rules","independentRule","Independent rule","equivalenceTypeLabels",{"_1469":1470,"_1471":1472,"_1473":1474},"mirror","left-right symmetry","complement","black-white symmetry","mirrorComplement","left-right + black-white symmetry","palindromeLabel","palindrome","noteSeparator"," — ","equivalentRuleFormat","Equivalent to Rule {0} ({1})","allRulesHeaders",{"_1309":1483,"_1484":1485,"_1486":1487},"Rule","class","Class","notes","Notes","tetrimimus",{"_11":1490,"_15":1491,"_25":1492,"_1186":1187,"_1188":1493},"Tetrimimus - Tetris-style Falling Blocks","Play a falling-block puzzle game in your browser. Studies show that just 3 minutes of block-puzzle play can reduce stress.","A falling-block puzzle game. Rotate and move blocks to clear lines. Research suggests that short sessions of block-puzzle games can help reduce stress. Give your tired brain a 3-minute refresh.",[1494,1495],"A single-sided tetromino block piece, constructed by combining four squares, falls randomly from the upper part of the field, one type at a time.","When any 1 to 4 rows of the grid are completely filled with blocks, those rows disappear, and points are awarded based on the number of rows cleared. Clearing multiple rows simultaneously (up to 4 rows) results in higher points.","pacBoy",{"_11":1498,"_15":1499,"_25":1500,"_1186":1187,"_1188":1501},"Pac-Boy - 1D Pac-Man Style Dot-Eating Game","Play Pac-Boy, a 1D dot-eating game inspired by Pac-Man. A remake of ABA Games' PAKU PAKU.","A 1D dot-eating game similar to Pac-Man. A remake of ABA Games' PAKU PAKU. Eat dots while evading enemies.",[1502,1503,1504],"The player's goal is to eat as many dots as possible while evading the enemies.","After eating a large dot, the player can eat the enemies for a limited time.","Once all the dots have been eaten, new dots will appear.","en-tools-web",{"_5":6,"_9":1507},{"_11":12,"_1120":1508},{"_11":1122,"_15":1123,"_1124":1509},{"_11":1126,"_15":1127,"_25":1128,"_27":1129,"_144":1130,"_29":30,"_1131":1132,"_217":1510,"_137":138,"_204":1515},[1511,1512,1513,1514],{"_11":1135,"_221":1136},{"_11":1138,"_221":1139},{"_11":1141,"_221":1142},{"_11":1144,"_221":1145},[1516,1517],{"_207":1148,"_209":1149},{"_207":1151,"_209":1152},"actionData","errors"]