OpenLLM-France/wikimedia huggingface dataset:
# Rousseau Gambit Declined

White makes his best response leaving Black with the difficult position resulting from the Rousseau Gambit Declined.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation.
1.e4 e5 2.Nf3 Nc6 3.Bc4 f5 4.d3
| 4 | 5 | 6 |
| Nf6 | O-O Bc5 | Nc3 d6 | +/- |
When contributing to this Wikibook, please follow the Conventions for organization.
# Scotch Gambit Accepted
### 8…Qa5

8…Qa5 moves the queen to safety. Now White can capture the knight on e4, while Black often soon castles queenside. However, Black remains up a pawn for the moment.
Nxe4 is the more common capture.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation.
1. e4 e5 2. Nf3 Nc6 3. Bc4 Nf6 4.d4 exd4 5. O-O Nxe4 6. Re1 d5 7. Bxd5 Qxd5 8. Nc3 Qa5
| | 9 | 10 | |
| Main Line | Nxe4 Be6 | Neg5 O-O-O | ∞ |
When contributing to this Wikibook, please follow the Conventions for organization.
# Rousseau Gambit
### 3...f5

    White has two strong choices: The first is to support with 4. d3. This results in a reversed King's Gambit Declined, dangerous for both sides. Black often places their pieces in typical Giuoco Piano fashion and waits for white to castle kingside before pushing f4. Black will attack the kingside and white will attack in the center.
    White can also play 4. d4. Black responds by taking one of the pawns. If 4...exd4 then 5. e5 and black will play 5...d5 or 5...d6 allowing the center to open; white quickly castles with a huge initiative. If 4...fxe4 then 5. Nxe5 and white is in an improved version of the main line of the Latvian Gambit.
    Taking with 4. exf5? is a common mistake by beginners. After 4...e4, white has to find the piece sacrifice 5. Nd4!, planning to respond to 5...Nxd4?? with Qh5+ and going into massive complications that favor white. But if black plays the correct 5...Nf6 then black already has a small advantage. Attempting to defend the pawn with 4. Nc3?? is a losing blunder.
    Key themes for White at this point are to attack Black's kingside using the light bishop and to resist attempts by black to simplify the position via exchanges. Exchanges involving White's light bishop are particularly suspect. The best advice for Black is to not play this gambit, as it's considered to be refuted.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.e4 e5 2.Nf3 Nc6 3.Bc4 f5
| | 4 | 5 | 6 | 7 |
| 1 | d3 Nf6 | O-O Bc5 | Nc3 d6 | +/= |
| 2 | ... ... | ... fxe4 | dxe4 Bc5 | +/= |
| 3 | d4 fxe4 | Nxe5 d5 | Bb5 Qd6 | +/= |
| 4 | exf5 e4 | Nd4 Nf6 | Nxc6 dxc6 | = |
| 5 | ... ... | ... Nxd4? | Qh5+ - | +/- |
When contributing to this Wikibook, please follow the Conventions for organization.
# Two Knights Defence - Modern Variation
### 5. e5

This is the modern variation. White advances the e-pawn in an attempt to gain central control.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
    1. e4 e5 2. Nf3 Nc6 3. Bc4 Nf6 4.d4 exd4
| 5 | 6 | 7 | 8 | 9 | 10 |
| e5 d5 | Bb5 Ne4 | Nxd4 Bd7 | Bxc6 bxc6 | O-O Bc5 | f3 Ng5 | = |
| ... Ng4 | Qe2 Qe7 | Bf4 f6 | exf6 Qxe2+ | Bxe2 Nxf6 | | = |
| ... Ne4 | O-O d5 | exd6 Nxd6 | Bd5 Be7 | | | = |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Parham Attack
### 3... Nf6??

Black's hotheaded desire to prove that the queen was misplaced and to take the queen has backfired. The next move will be 4.Qxf7# (standing for mate). The one natural developing move leads to mate - and that is why black has to always be careful for Scholar's mate.

## Theory table

1. e4 e5 2. Qh5 Nc6 3. Bc4 Nf6
White only requires one move here: 4. Qxf7#
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Illustrated Chess for Children. 1960. Harvey Kidder. Publisher, Doubleday ISBN 0-385-05764-4.
# Chess Opening Theory/1. e4/1...e5/2. Qh5/2...Nf6
## Kiddie Countergambit
### 2...Nf6

This move prevents Scholar's Mate by attacking the queen, forcing it to move away from the diagonal. While it sacrifices a pawn (White can take the e-pawn with 3. Qxe5+), it gives Black a lead in development.
Though 2...Nc6 is considered more solid, this variation is still playable. Because White's bishop has not been moved yet, checkmate is not possible. Even if the queen moves to f3, there is no checkmate threat, as the knight is in the way. Also, unlike 2...g6??, the rook is not blundered, as the knight and g-pawn are in the way.
The best continuation is 3. Qxe5+ Be7.
When contributing to this Wikibook, please follow the Conventions for organization.
# Chess Opening Theory/1. e4/1...e5/2. Qh5/2...Nc6/3. Bc4/3...Nf6/4. Qxf7
## Parham Attack/Scholar's Mate
### 4. Qxf7#

With this move White gives a checkmate. The Black King cannot take the White queen because the White Bishop on c4 defends it. Further, moving the Black King to e7(Ke7) does not allow it to escape capture on the next move, so this position is checkmate, and White has won the game.
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Illustrated Chess for Children. 1960. Harvey Kidder. Publisher, Doubleday ISBN 0-385-05764-4.
# Parham Attack
### 3...g6

Black counterattacks the White queen, and blocks 4. Qxf7#. White then moves the queen to safety on f3 and attacks f7 from a different angle.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. e4 e5 2. Qh5 Nc6
| 4 | 5 | 6 | 7 |
| Qf3 Nf6 | Ne2 Bg7 | Nbc3 d6 | d3 O-O | =/+ |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Illustrated Chess for Children. 1960. Harvey Kidder. Publisher, Doubleday ISBN 0-385-05764-4.

## External links

* Woody Harrelson vs Garry Kasparov at chessgames.com
# Frederiksberg Variation
### 4...f5

Black 'sacrifices' the f5 pawn, although it can't actually be taken, because of 5...Nd4. White's queen is stuck in the center and is a target for Black's knights, bishops and pawns. Black can sometimes play f4, with the idea of Bg4 trapping the queen.
White will have to play very carefully to not end up dead lost.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. e4 e5 2. Qh5 Nc6 3. Bc4 g6 4. Qf3 f5
| 5 | 6 | 7 | 8 |
| Ne2 Nf6 | Nc3 d6 | exf5 Bxf5 | d3 Bg4 | = |
| exf5? Nd4 | Qd5 Qe7 | Na3 c6 | -+ |
| exf5? Nd4 | Qd1 Qg5 | g3 Qxf5 | -+ |
When contributing to this Wikibook, please follow the Conventions for organization.
# Chess Opening Theory/1. e4/1...e5/2. Qh5/2...Nf6/3. Qxe5
## Kiddie Countergambit
### 3. Qxe5+

White captures the undefended e5 pawn and gives check. There are two ways for Black to respond: 3...Be7 or 3...Qe7?!. 3...Be7 is better, since after 4...Nc6, White will need to spend a tempo retreating the queen. 3...Qe7 allows a queen trade, meaning White no longer needs to spend the tempo retreating, thus giving back the advantage to White. After 3...Qe7 4. Qxe7 Bxe7, White is up a central pawn while Black is barely ahead in development.
When contributing to this Wikibook, please follow the Conventions for organization.
# Algebraic Topology/The fundamental group

Definition (fundamental group):
Let $X$ be a topological space and let $x_{0}\in X$. The fundamental group of $X$ based at $x_{0}$ is the group of homotopy equivalence classes of loops at $x_{0}$ leaving the endpoints fixed
    $\pi _{1}(X,x_{0}):=\{[\gamma ]|\gamma :[0,1]\to X,\gamma (0)=\gamma (1)=x_{0}\}$
where the group law is given by concatenation of paths.
# Algebraic Topology

Algebraic topology is study of topological spaces, usually via the tools of abstract algebra, such as groups, rings and fields. As with many fields of mathematics, the goal is to classify the objects of interest up to some equivalence relation, in this case we wish to classify topological spaces up to homeomorphism (although we will find that the best we can often do is homotopic equivalence).
* The fundamental group
* The fundamental group and covering spaces
* Simplicial homology
* Singular homology
* Cellular homology
# Algebraic Topology/Singular homology

Definition (standard n-simplex):
The standard $n$-simplex is the set
    $\Delta _{n}:=\left\{(t_{0},\ldots ,t_{n}){\big |}\forall 0\leq j\leq n:t_{j}\geq 0\wedge \sum _{j=0}^{n}t_{j}=1\right\}$.
Definition (singular chain complex):
Let $X$ be a topological space. The singular chain complex associated to $X$ is the chain complex $C_{n}(X)$ of abelian groups whose $n$-th group is given by the free abelian group over all continuous functions $\sigma :\Delta _{n}\to X$ and whose differential $\partial :C_{n}(X)\to C_{n-1}(X)$ is given by the linear extension of the formula
    $\partial \sigma =\sum _{j=0}^{n}(-1)^{j}\sigma _{j}$ for $\sigma :\Delta _{n}\to X$ continuous,
    where $\sigma _{j}:\Delta _{n-1}\to X,\sigma _{j}(t_{0},\ldots ,t_{n-1}):=\sigma (t_{0},\ldots ,t_{j-1},0,t_{j},\ldots ,t_{n-1})$.
# Algodoo Tutorials
## Table of Contents
### Marble Race Tutorials

Marble Race Tutorial 1:Marbles
Marble Race Tutorial 2:Basic Track
Marble Race Tutorial 3:Spinners
Marble Race Tutorial 4:Plinko Obstacle
Marble Race Tutorial 5:Zigzag Paths
Please wait for contents to be added.

### Mini Kart Race Tutorials

Nothing yet.
# Algodoo Tutorials/Marbles
## Introduction

Marbles are the most important things in any marble races. Without marbles, it wouldn't be a race. Marbles are made out of two different parts-circle and tracer. The tracer is not nessacery, but a lot of people use them.

## Circle

The first thing people needed to do to make a marble is to make a circle that rolls like a marble and bounce like a marble (Except if they are using custom marbles.). First, use the circle tool to make a circle. Don't make it too big, otherwise it will not bounce much, and also don't make it too small, it moves a lot faster, bounces higher and it is easier for them to glitch out the track. So about a quarter of a meter for each marble. Right click on the marble, go to appearance and choose a color you want. Deselect "Draw Borders" if you don't want the borders to appear for the marbles (It looks the same for a completely black marble.) Also deselect "Circle Cake" if you want it to look neat (Again, it looks the same for a black marble.). Now you have your circle.

## Tracer

This tracer part is optional.
This part is very simple. Right click on your marble, go to Geometry Actions and select "Attach Tracer". The tracer will appear as the same color as your marble. Select the tracer, go to Tracers, change "Fading time to something low, but not zero. If you don't want the tracer to show up at the front, deselect yourmarble by clicking somewhere else, select the tracer, go to Selections and select "Move Selected to Back". You won't see it anymore, but it is still there- behind the marble.
# Algorithm Implementation

The purpose of this wikibook is to show how common algorithms are written in various programming languages, providing code implementations and explanation.
The plan for this book is initially to collect code from some Wikipedia articles. Then the code can be expanded upon, perfected, and heavily commented to provide insight into how it works.

## Contents

* Index
* Checksums
* Date and time
* Filesystem
* Geometry
* Graphs
* Hashing
* Linear Algebra
* Mathematics
* Miscellaneous
* Optimization
* Pseudorandom Numbers
* Search
* Simulation
* Sorting
* String searching
* Strings
* Statistics
* Trees

## See also

* Commons : Images including source code in their description
* Rosetta Code
# Algorithm Implementation/Checksums

Some people view checksums as a kind of hashing but collisions (different inputs, same result) are likely. Checksums are used when irrecoverable errors must be detected to prevent further data corruption in a system. If correction is needed, ECC (Error Correcting Codes such as Hamming, Reed Solomon or BCH) are required.
Collision rates are a compromise with size and speed of computation. The odds of failed detections for n bits of checksum is 2^-n. The choice of this size depends on the application's requirements and the expected error model (the types and probabilities of errors). 16-bit checksum fields are small but one false positive occurs for every 65536 random inputs (at best) so it is used when data blocks are small, the consequences are benign and/or the corruption is very unlikely. 32-bit checksums have double the size overhead but only 1 chance in 4 billions of collision so it is common for storing or transmitting large files if they may be altered.
A programmer writing a checksum algorithm could use one's complement addition if one is willing to sacrifice error detection effectiveness for very high speed (such as for EXE files or IP header packets), Fletcher-32 checksum for a balance of speed and error detection (though it can not distinguish between 0xFFFF and 0x0000), CRC-32 for better error detection but more complex implementations when performance is needed. A programmer should use a MAC or digital signature—typically involving a cryptographically secure hash such as SHA-256 or SHA-3 -- if one is willing to run slower and allocate 256 bits or more in order to detect malicious alterations to data. Such hashes are covered in a later chapter, Hashing.
* PEAC (Pisano with End-Around Carry) is as fast as Fletcher and Adler checksums, with better error detection (almost as good as CRC) by using 1s complement addition (also called End Around Carry) in a Pisano (truncated Fibonacci) structure. A pair of 16-bit registers makes a checksum comparable to CRC32 with much less coding complexity. For a 16-bit only checksum, the two 16-bit registers can be added.
* Verhoeff Algorithm
* Damm Algorithm

## Cyclic Redundancy Checks

* CRC16 CCITT
* CRC16 XModem
* CRC32 / FCS32 - commonly used in Ethernet and PKZip-compatible archiving

## Further reading

* ↑ Theresa C. Maxino. "The Effectiveness of Checksums for Embedded Networks" compares the error detection effectiveness of commonly used checksums: exclusive or (XOR), two's complement addition, ones' complement addition, Fletcher checksum, Adler checksum, and cyclic redundancy codes (CRC) ... briefly mentions that "weighted sum codes" might be just as good as CRC in error detection but with lower computational cost ... discusses common misconceptions about error check codes.
* ↑ Yann Guidon / YGDES. "PEAC Pisano with End-Around Carry algorithm".
* Serial Programming/Error Correction Methods
* Data Coding Theory
* Wikipedia: cyclic redundancy check
* wxWiki: Cyclic Redundancy Check implementations
* Wikipedia: Fletcher's checksum
* datacompression wiki: FAQ:I need a CRC algorithm
* Stack Overflow: tutorial about Cyclic Redundancy Check?
# C++ Programming/Code/Standard C Library/Functions/fseek
#### fseek

| Syntax | #include <cstdio> int fseek( FILE *stream, long offset, int origin ); |
The function fseek sets the file position data for the given stream. The origin value should have one of the following values (defined in cstdio):
| Name | Explanation |
| SEEK_SET | Seek from the start of the file |
| SEEK_CUR | Seek from the current location |
| SEEK_END | Seek from the end of the file |
fseek returns zero upon success, non-zero on failure. You can use fseek to move beyond a file, but not before the beginning. Using fseek clears the EOF flag associated with that stream.

##### Related topics

    fgetpos - fopen - fsetpos - ftell - rewind
# C++ Programming/Code/Standard C Library/Functions/fwrite
#### fwrite

| Syntax | #include <cstdio> int fwrite( const void *buffer, size_t size, size_t count, FILE *stream ); |
The fwrite function writes, from the array buffer, count objects of size size to stream. The return value is the number of objects written.

##### Related topics

    fflush - fgetc - fopen - fputc - fread - fscanf - getc
# C++ Programming/Code/Standard C Library/Functions/gmtime
#### gmtime

| Syntax | #include <ctime> struct tm *gmtime( const time_t *time ); |
The gmtime function returns the given time in Coordinated Universal Time (usually Greenwich mean time), unless it's not supported by the system, in which case NULL is returned. Watch out for the static return.

##### Related topics

    asctime - ctime - difftime - localtime - mktime - strftime - time
# C++ Programming/Code/Standard C Library/Functions/ftell
#### ftell

| Syntax | #include <cstdio> long ftell( FILE *stream ); |
The ftell function returns the current file position for stream, or -1 if an error occurs.

##### Related topics

    fgetpos - fseek - fsetpos
# C++ Programming/Code/Standard C Library/Functions/getc
#### getc

| Syntax | #include <cstdio> int getc( FILE *stream ); |
The getc function returns the next character from stream, or EOF if the end of file is reached. getc is identical to fgetc. For example:

##### Related topics

    feof - fflush - fgetc - fopen - fputc - fgetc - fread - fwrite - putc - ungetc
# C++ Programming/Code/Standard C Library/Functions/getchar
#### getchar

| Syntax | #include <cstdio> int getchar( void ); |
The getchar function returns the next character from stdin, or EOF if the end of file is reached.

##### Related topics

    fgetc - fopen - fputc - putc
# C++ Programming/Code/Standard C Library/Functions/getenv
#### getenv

| Syntax | #include <cstdlib> char *getenv( const char *name ); |
The function getenv returns environmental information associated with name, and is very implementation dependent. NULL is returned if no information about name is available.

##### Related topics

    system
# C++ Programming/Code/Standard C Library/Functions/gets
#### gets

| Syntax | #include <cstdio> char *gets( char *str ); |
The gets function reads characters from stdin and loads them into str, until a newline or EOF is reached. The newline character is translated into a null termination. The return value of gets is the read-in string, or NULL if there is an error.

##### Related topics

    fgetc - fgets - fputs - puts
# C++ Programming/Code/Standard C Library/Functions/fscanf
## fscanf

| Syntax | #include <cstdio> int fscanf( FILE *stream, const char *format, ... ); |
The function fscanf reads data from the given file stream in a manner exactly like scanf. The return value of fscanf is the number of variables that are actually assigned values, including zero if there were no matches. EOF is returned if there was an error reading before the first match.

### Related topics

    fgets - fprintf - fputs - fread - fwrite - scanf - sscanf
# C++ Programming/Code/Standard C Library/Functions/fsetpos
#### fsetpos

| Syntax | #include <cstdio> int fsetpos( FILE *stream, const fpos_t *position ); |
The fsetpos function moves the file position indicator for the given stream to a location specified by the position object. fpos_t is defined in cstdio. The return value for fsetpos is zero upon success, non-zero on failure.

##### Related topics

    fgetpos - fseek - ftell
# CRE Loaded Features
## CRE Loaded

CRE Loaded is a content management program for creating online shops - from products to payments. For short this is simply known as "shopping cart" or "cart" software.
CRE Loaded is derived from another shopping cart called osCommerce - it has inherited all of its features and has added many more. This book aims to act as a reference for CRE Loaded users, imparting a thorough understanding of the all the features of CRE Loaded including those it shares with its parent. It assumes that the user does not look after the internet server on which it runs or the underlying code for the site. The book assumes users have already got a CRE Loaded Site up on the server and ready to go.
The version of CRE Loaded this book refers to is 6.15 throughout.

## Contents

* Introduction
* Administration
* Configuration
* Catalog
* Info System
* NewsDesk
* FAQDesk
* Modules
* Vouchers/Coupons
* Customers/Orders
* Affiliates
* Locations/Taxes
* Localization
* Design Controls
* Links Manager
* Reports
* Tools
* Appendix Administrator
# Administrator

This is the part of CRE Loaded where you can assign permissions to individuals or groups. For instance you can create a group called 'Catalog Editor' and allow members only to access the catalog

## Member Groups

To enter this section click on the following on the left-hand bar in CRE Loaded.

### To add a new user

Click the following:
Then fill in the spaces for Firstname, Lastname, Email Address, and Group Level

### To add a new group

Click on the following:
Then fill in the space for group name and click next.
Remember that before users can do anything with this group the group has to be given permissions.

### To add or remove a group's permissions

Click on the following:
Then from the list displayed click on the relevant group. Clicking new permission from here will produce a list of permissions. To add a permission check the relevant check box.
A list of permissions will be given in Appendix_Administrator
true that

## Update Account

Allows simple alterations to your account.

## File Access

Allows an administrator to install and uninstall directories on the server.
# CRE Loaded Features/Configuration/Customer Details
## Gender

True = gender is displayed in the customer's account.
False = gender is not displayed in customer's account.

## Date of Birth

True = date of birth is displayed in the customer's account.
False = date of birth is not displayed in customer's account.

## Company

True = company is displayed in the customer's account.
False = company is not displayed in customer's account.

## Suburb

True = suburb is displayed in the customer's account.
False = suburb is not displayed in customer's account.

## State

True =state is displayed in the customer's account.
False = state is not displayed in customer's account.

## Require E-mail confirmation

True = Require email confirmation when creating new account.
False = Require email confirmation when creating new account.

## Require accepted conditions of use

True = Customers will be prompted to accept the conditions of use of your site when signing up.
False = Customers will not be prompted to accept the conditions of use of your site when signing up.
# Canadian Patent Law

This text is intended to provide a overview of the area of patent law in Canada.

## Contents

* Introduction
* Patentable matter
* Patent specifications
* Novelty
* Obviousness
* Utility
* Sufficiency
* Infringement

## See also

* Canadian Trade-mark Law
* Canadian Copyright Law
# Canadian LGBT History/Introduction

This is the Canadian LGBT History wikibook. The goal of this wikibook is to provide free information about the social, legal and political history of Canada's LGBT communities and people. This wikibook aims to be inclusive and well-researched, which means we will be using as many primary sources and credible secondary sources as possible. It is intended for older students who wish to learn about the history of LGBT rights, lifestyles and communities in Canada. Feel free to contribute!
# Canadian Patent Law/Introduction

Patent law is a statutory regime that is designed to protect inventions. An inventor may apply to have their invention registered with a patent which provides them the right to exclude others from profitting from the invention. Much like copyright law, patent law is a purely statutory system that is in the exclusive domain of the federal government. The area of law is regulated by the Patent Act which outlines the scope of the patent regime, the rights and resonsibilities of a patent holder, the methods of applying for a patent, among other things.