AI coding assistants such as Cursor and GitHub Copilot are increasingly embedded in professional software development workflows. As these tools become more common, computer science education faces the challenge of preparing students both to write code independently and to collaborate effectively with AI-assisted tools. This dual expectation is difficult to address through traditional assignment design.

This poster explores the potential of ChatGPT to replace the traditional approach of pair programming in introductory computer science courses. Traditionally, two students collaborate as a driver and a navigator, periodically switching roles. Now, a student can pair up with ChatGPT, which offers an innovative approach to pair programming. This exploratory activity, which emphasizes collaboration and communication, provides step-by-step instructions for effectively interacting with ChatGPT during pair programming.

Applying various algorithms learned from the courses of Algorithms and Artificial Intelligence to solve real-world problems is intriguing, especially considering that most problems found in textbooks tend to be either trivial, theoretical, or oversimplified. In this poster, we present a challenging project where we apply a variety of common algorithms and their variations to solve the snake game. Our project's primary goal is to develop a perfect snake algorithm, defined as one that collects food until the grid is entirely covered by the snake, indicating the completion of the game, ideally achieved in as few steps as possible. This project is particularly intriguing as it offers a novel approach to completing the game, a task that humans often find challenging.

Tower of Hanoi is a classical tutorial example traditionally for introducing recursive algorithms in CS1. This poster describes a lecture of teaching graph algorithms using the graphical representation of the game and its variants in upper-level courses. More specifically, this poster provides a totally different perspective on solving the tower of Hanoi using DFS, BFS, A*, greedy, and other search algorithms on graphs. Students will not only solve the game and its variants in an inspiring way, but also learn a modeling method to convert problems into graphs.