Skip to main content

RBC takes European traders to the Endgame

The Canadian bank’s complex execution algorithm, increasingly popular with traders stateside, is making landfall in Europe. But the region’s fragmented markets mean adoption is not simply a matter of plug-and-play.

Robot concedes chess game

Scaling complexity is difficult.

In 1950, American mathematician and father of information theory Claude Shannon estimated the lower bound of the number of possible legal chess games to demonstrate how complicated the game was. Using the assumption that on any given move a player has roughly 30 legal moves on average, and the average game lasts around 40 moves per player, Shannon estimated the number of possible game sequences as 10^120, or 1 followed by 120 zeros.

For comparison, the number of

Only users who have a paid subscription or are part of a corporate subscription are able to print or copy content.

To access these options, along with all other subscription benefits, please contact info@waterstechnology.com or view our subscription options here: https://subscriptions.waterstechnology.com/subscribe

You are currently unable to copy this content. Please contact info@waterstechnology.com to find out more.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to Waterstechnology? View our subscription options

Register for free

Access two articles, our IMD and Waters Wraps, plus a member newsletter. Find out more.

All fields are mandatory unless otherwise highlighted.

Show password
Hide password

Most read articles loading...

You need to sign in to use this feature. If you don’t have a WatersTechnology account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here