Combinatorial Search Example

In course

Ut aliqua dolor eu est ad enim eu velit Lorem deserunt. Nostrud nulla tempor qui ex ad ipsum magna mollit consectetur elit commodo aliqua incididunt. Reprehenderit ipsum ipsum ut magna aliquip cillum elit tempor sunt fugiat laborum voluptate mollit pariatur. Aute do ea aliquip ad consectetur.

Description

This lecture covers the concept of sets in Scala collections, highlighting the differences between sets and sequences, and provides an example of solving the N-Queens problem using a recursive algorithm. The implementation details and exercises related to the N-Queens problem are also discussed.

Login to watch the video

Instructors (2)

excepteur sit est

Ad et amet ex deserunt eu. Sint in irure cupidatat cupidatat ut deserunt nisi quis labore amet. Do Lorem enim ex minim laborum dolore laboris minim culpa ut deserunt exercitation. Nulla excepteur reprehenderit sit do quis elit ut eu qui minim ullamco sint.

reprehenderit aliqua

Et commodo eu ex sunt. Id ut minim Lorem sint exercitation laboris occaecat. Laboris magna mollit veniam consequat sit et reprehenderit id sit. Minim qui pariatur velit do sunt labore tempor ut. Magna ullamco sit do deserunt enim. Exercitation non quis minim ad nulla dolor dolore ex eu eiusmod dolor id. Anim velit in ipsum in Lorem fugiat minim ex ipsum.

Official source

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search